Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A course in number theory and cryptography
A course in number theory and cryptography
Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
Designs, Codes and Cryptography
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Efficient Construction of Cryptographically Strong Elliptic Curves
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Universal Exponentiation Algorithm
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
A new baby-step giant-step algorithm and some applications to cryptanalysis
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
| Hi-index | 0.00 |
Elliptic curve cryptography provides a higher performance than the classic cryptography mainly because shorter keys are used. This paper presents the basics of the elliptic curves, emphasizing the advantage of using them in ecommerce cryptography, this implies a certain level of fields definition for them. We also present several algorithms for scalar multiplication point and for generating strong elliptic curves. Starting from the existing ones, we present an open problem about the weakness of such a systems, in the field of large key computations.