Reducing the elliptic curve cryptosystem of Meyer-Muller to the cryptosystem of Rabin-Williams
(1998) Designs, Codes and Cryptography — Vol. 14, n° 1, p. 53-56 (1998)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Meyer and Muller (1996) have presented a new Rabin-type cryptosystem based on elliptic curves with a public encryption exponent equal to 2. We show that this cryptosystem may be reduced to the cryptosystem of Rabin-Williams.
- Affiliations
Citations
Joye, M., & Quisquater, J.-J. (1998). Reducing the elliptic curve cryptosystem of Meyer-Muller to the cryptosystem of Rabin-Williams. Designs, Codes and Cryptography, 14(1), 53-56. https://hdl.handle.net/2078.5/148776 (Original work published 1998)