Non Supersingular Elliptic Curves for Public Key Cryptosystems
For public key cryptosystems multiplication on elliptic curves can be used instead of exponentiation in finite fields. One attack to such a system is: embedding the elliptic curve group into the multiplicative group of a finite field via weilpairing; calculating the discrete logarithm on the curve by solving the discrete logarithm in the finite field. This attack can be avoided by constructing curves so that every embedding in a multiplicative group of a finite field requires a field of very large size.
KeywordsElliptic Curve Finite Field Elliptic Curf Multiplicative Group Discrete Logarithm
- T. Beth, W. Geiselmann, F. Schaefer; Arithmetics on Elliptic Curves; Algebraic and Combinatorical Coding Theory, 2nd int. workshop, Leningrad, 1990, pp. 28–33.Google Scholar
- A. Menezes, T. Okamoto, S. A. Vanstone; Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field; University of Waterloo, preliminary version, sep. 1990.Google Scholar
- V. S. Miller; Use of Elliptic Curves in Cryptography; Advances in Cryptology: Proceedings of Crypto 85, Springer LNCS 218, 1986, pp. 417–426.Google Scholar
- W. C. Waterhouse, Abelian Varieties over finite fields; Ann. scient. Ec. Norm. Sup., 4th serie, 1969, pp. 521–560.Google Scholar