Skip to main content
SpringerLink
Log in

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

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

At Eurocrypt '96, Meyer and Müller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Rabin-Williams.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Bleichenbacher. Personal communication.

  2. D. Coppersmith. Finding a small root of a univariate modular equation. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 155-165.

  3. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Low-exponent RSA with related messages. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 1-9.

  4. M. Joye and J.-J. Quisquater. On the cryptosystem of Chua and Ling. Technical Report CG-1997/4, UCL Crypto Group, April (1997).

  5. K. Koyama, U. Maurer, T. Okamoto, and S. Vanstone. New public-key schemes based on elliptic curves over the ring Z n. In J. Feigenbaum, editor, Advances of Cryptology - Crypto'91, volume 576 of Lectures Notes in Computer Science, Springer-Verlag (1991) pp. 252-256.

  6. H. Kuwakado and K. Koyama. A uniquely decipherable Rabin-type scheme over elliptic curves. Technical Report ISEC95-33 (in Japanese), IEICE, December (1995).

  7. B. Meyer and V. Müller. A public key cryptosystem based on elliptic curves over Z /n Zequivalent to factoring. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 49-59.

  8. J. Patarin. Some serious protocol failures for RSA with exponent eof less than ≃ 32 bits. In Proceedings of the Conference of Cryptography, Luminy, France, September (1995).

  9. M. O. Rabin. Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT, Laboratory for Computer Science, January (1979).

  10. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, Vol. 21, No.2 (1978) pp. 120-126.

    Google Scholar 

  11. H. C. Williams. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory, IT Vol. 26, No.6 November (1980) pp. 726-729.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UCL Crypto Group, Dép. de Mathématique, Université de Louvain, Chemin du Cyclotron 2, B-1348, Louvain-la-Neuve, Belgium

    Marc Joye & Jean-Jacques Quisquater

Authors
  1. Marc Joye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Jacques Quisquater
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Joye, M., Quisquater, JJ. Reducing the Elliptic Curve Cryptosystem of Meyer-Müller to the Cryptosystem of Rabin-Williams. Designs, Codes and Cryptography 14, 53–56 (1998). https://doi.org/10.1023/A:1008256404676

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008256404676

Search

Navigation