Abstract
Elliptic curves over the ring ℤ/nℤ where n is the product of two large primes have first been proposed for public key cryptosystems in [4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to factoring the modulus n. Moreover, we extend the ideas to get a signature scheme based on elliptic curves over ℤ/nℤ.
Author was supported by the Deutsche Forschungsgemeinschaft
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Joye, J.-J. Quisquater: Personal communication
M. Joye, J.-J. Quisquater: Note on the public-key cryptosystem of Meyer and Müller, Technical Report CG-1996/2, Université catholique de Louvain
N. Koblitz: Elliptic curve cryptosystems, Mathematics of Computation, 48 (1987), 203–209
K. Koyama, U. Maurer, T. Okamoto, S. Vanstone: New Public-Key Schemes Based on Elliptic Curves over the Ring ℤn, Advances in Cryptology: Proceedings of Crypto’ 91, Lecture Notes in Computer Science, 576 (1991), Springer-Verlag, 252–266
K. Kurosawa, K. Okada, S. Tsujii: Low exponent attack against elliptic curve RSA, Advances in Cryptology-ASIACRYPT’ 94, Lecture Notes in Computer Science, 917 (1995), Springer-Verlag, 376–383
A. Menezes: Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers (1993)
V. Miller: Uses of elliptic curves in cryptography, Advances in Cryptology: Proceedings of Crypto’ 85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417–426
V. Shoup: A New Polynomial Factorization Algorithm and its Implementation, Preprint, (1995)
J. H. Silverman: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, 106, Springer-Verlag, (1986)
H. C. Williams: A modification of the RSA public-key encryption procedure, IEEE Transactions on Information Theory, IT-26, No. 6, (1980), 726–729
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, B., Müller, V. (1996). A Public Key Cryptosystem Based on Elliptic Curves over ℤ/nℤ Equivalent to Factoring. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive