A public key cryptosystem based on elliptic curves over Z/nZ equivalent to factoring

Authors:
Bernd Meyer;Volker Müller
Affiliations:
Universität des Saarlandes, Fachbereich Informatik, Saarbrückcn, Germany;Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario, Canada
Venue:
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Year:
1996

Citing 4
Cited 3

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Low Exponent Attack against Elliptic Curve RSA

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology

Reducing the Elliptic Curve Cryptosystem of Meyer-Müllerto the Cryptosystem of Rabin-Williams

Designs, Codes and Cryptography
Generalised Cycling Attacks on RSA and Strong RSA Primes

ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Pairings on elliptic curves over finite commutative rings

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elliptic curves over the ring Z/nZ 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 Z/nZ.