Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Optimal normal bases in GF(pn)
Discrete Applied Mathematics
A course in computational algebraic number theory
A course in computational algebraic number theory
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Efficient elliptic curve exponentiation
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
New formulae for efficient elliptic curve arithmetic
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Analysis of ECDSA authentication processing in VANETs
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
| Hi-index | 0.00 |
This paper explores elliptic curve cryptosystems over fields of small odd characteristic p = 3 or 5. We establish formulas multiplying by p a random point on an ordinary curve defined over $\mathbb{F}_{p^{n}}$, thereby improving scalar multiplication on random and special curves for p = 3 or 5 using a p-Multiply-and-Add method. We study the complexity of our method and compare it to other schemes.