Loading...
Please wait, while we are loading the content...
Similar Documents
Preference of efficient architectures for gf(p) elliptic curve crypto operations using multiple parallel multipliers.
| Content Provider | CiteSeerX |
|---|---|
| Author | Gutub, Adnan Abdul-Aziz |
| Abstract | This paper explores architecture possibilities to utilize more than one multiplier to speedup the computation of GF(p) elliptic curve crypto systems. The architectures considers projective coordinates to reduce the GF(p) inversion complexity through additional multiplication operations. The study compares the standard projective coordinates (X/Z,Y/Z) with the Jacobian coordinates (X/Z 2,Y/Z 3) exploiting their multiplication operations parallelism. We assume using 2, 3, 4, and 5 parallel multipliers and accordingly choose the appropriate projective coordinate efficiently. The study proved that the Jacobian coordinates (X/Z 2,Y/Z 3) is preferred when single or two multipliers are used. Whenever 3 or 4 multipliers are available, the standard projective coordinates (X/Z,Y/Z) are favored. We found that designs with 5 multipliers have no benefit over the 4 multipliers because of the data dependency. These architectures study are particularly attractive for elliptic curve cryptosystems when hardware area optimization is the key concern. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Adnan Abdul-aziz Gutub Preference Elliptic Curve Crypto Operation Multiple Parallel Multiplier Efficient Architecture Jacobian Coordinate Standard Projective Coordinate Elliptic Curve Crypto System Key Concern Additional Multiplication Operation Architecture Considers Architecture Possibility Inversion Complexity Multiplication Operation Parallelism Hardware Area Optimization Elliptic Curve Cryptosystems Appropriate Projective Coordinate Parallel Multiplier Data Dependency |
| Content Type | Text |
| Resource Type | Article |
