Name
Title | ||
|---|---|---|
Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate representation |
Abstract | ||
|---|---|---|
It has been recently shown that sharing a common coordinate in elliptic curve cryptography implementations improves the performance of scalar multiplication. This paper presents new formulæ for elliptic curves over prime fields that provide efficient point addition and doubling using the Montgomery ladder. All computations are performed in a common projective Z-coordinate representation to reduce the memory requirements of low-resource implementations. In addition, all given formulæ make only use of out-of-place operations therefore insuring that it requires no additional memory for any implementation of the underlying finite-field operations whatsoever. Our results outperform existing solutions in terms of memory and speed and allow a fast and secure implementation suitable for low-resource devices and embedded systems. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21969-6_11 | AFRICACRYPT |
Keywords | Field | DocType |
elliptic curve,secure implementation,memory-constrained implementation,memory requirement,low-resource implementation,common projective z-coordinate representation,new formul,elliptic curve cryptography implementation,low-resource device,efficient point addition,additional memory | Elliptic Curve Digital Signature Algorithm,Arithmetic,Montgomery curve,Elliptic curve point multiplication,Elliptic curve cryptography,Jacobian curve,Counting points on elliptic curves,Curve25519,Mathematics,Tripling-oriented Doche–Icart–Kohel curve | Conference |
Volume | ISSN | Citations |
6737 | 0302-9743 | 16 |
PageRank | References | Authors |
0.74 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Hutter | 1 | 345 | 25.26 |
| Marc Joye | 2 | 2413 | 170.74 |
| Yannick Sierra | 3 | 32 | 1.56 |