Elliptic Curve Cryptosystems
Neal Koblitz · Mathematics of Computation · 1987
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over ${\text {GF}}({2^n})$. We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.
Cited by 5,608 works. doi:10.1090/s0025-5718-1987-0866109-5 Open-access PDF
Authors
References
- New directions in cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Use of Elliptic Curves in Cryptography
- Discrete logarithms in finite fields and their cryptographic significance
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Elliptic curves over finite fields and the computation of square roots mod 𝑝
- Solved and Unsolved Problems in Number Theory.
- Solved and Unsolved Problems in Number Theory
- Introduction to Elliptic Curves and Modular Forms
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p