Advertisement

A New Elliptic Curve Based Analogue of RSA

  • N. Demytko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 765)

Abstract

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.

11 References

  1. [1]
    W. Diffie and M. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol. 22, pp. 644–654, 1976.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    V.S. Miller, “Use of Elliptic Curves in Cryptography”, Advances in Cryptology: Proceedings of CRYPTO’ 85, Lecture Notes in Computer Science, Vol. 218, pp. 417–426, Springer-Verlag, 1986.CrossRefGoogle Scholar
  3. [3]
    N. Koblitz, A Course in Number Theory and Cryptography, Spinger-Verlag, New York, 1987.zbMATHGoogle Scholar
  4. [4]
    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
  5. [5]
    R. Schoof, “Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p”, Mathematics of Computation, Vol.44, No.170, pp. 483–494, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    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
  7. [7]
    D.M. Bressoud, Factorisation and Primality Testing, Springer-Verlag, New York, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • N. Demytko
    • 1
  1. 1.Telecom Australia Research LaboratoriesClaytonAustralia

Personalised recommendations