A New Elliptic Curve Based Analogue of RSA
A new public key cryptosystem based on elliptic curves over the ring Zn is described. The scheme can be used for both digital signature and encryption applications, does not expand the amount of data that needs to be transmitted and appears to be immune from homomorphic attacks. The main advantage of this system over other similar elliptic curve based systems is that there is very little restriction on the types of elliptic curves and types of primes (comprising the arithmetic modulus, n) that can be used. In addition, the system works on fixed elliptic curves. Problems associated with imbedding plaintext onto a curve are avoided by working within a multiple group structure. This enables the encryption and decryption operations to be performed on only the first coordinate of points on the given curve. The security of the system relies on the difficulty of factorising large composite numbers.
- K. Koyama, U.M. Maurer, T. Okamoto and S.A. Vanstone, “New Public-Key Schemes Based on Elliptic Curves over the Ring Zn”, CRYPTO’ 91 Abstracts, Santa Barbara, CA, pp. 6-1 to 6-7, August 11–15, 1991.Google Scholar
- A.K. Lenstra and H.W. Lenstra, Jnr., “Algorithms in Number theory”, University of Chicago, Department of computer Science, Technical Report # 87-008, 1987.Google Scholar
- D.M. Bressoud, Factorisation and Primality Testing, Springer-Verlag, New York, 1989.Google Scholar