Designs, Codes and Cryptography

, Volume 14, Issue 1, pp 53–56

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

  • Marc Joye
  • Jean-Jacques Quisquater
Article
  • 51 Downloads

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.

cryptography elliptic curves Rabin-type cryptosystems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Bleichenbacher. Personal communication.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 4.
    M. Joye and J.-J. Quisquater. On the cryptosystem of Chua and Ling. Technical Report CG-1997/4, UCL Crypto Group, April (1997).Google Scholar
  5. 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.Google Scholar
  6. 6.
    H. Kuwakado and K. Koyama. A uniquely decipherable Rabin-type scheme over elliptic curves. Technical Report ISEC95-33 (in Japanese), IEICE, December (1995).Google Scholar
  7. 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.Google Scholar
  8. 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).Google Scholar
  9. 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).Google Scholar
  10. 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. 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

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Marc Joye
    • 1
  • Jean-Jacques Quisquater
    • 1
  1. 1.UCL Crypto Group, Dép. de MathématiqueUniversité de LouvainLouvain-la-Neuve, Belgium

Personalised recommendations