A comparison of RSA and the Naccache-Stern public-key cryptosystem

  • Thomas W. Cusick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1189)


In September 1995, David Naccache and Jacques Stern proposed a new public key cryptosystem. We give an analysis of this cryptosystem and we make a comparison with the well-known RSA system.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. R. Blakley and I. Borosh, Rivest-Shamir-Adleman public-key cryptosystems do not always conceal messages, Comput. Math. with Applic. 5 (1979), 169–178.CrossRefGoogle Scholar
  2. 2.
    Y. Desmedt and A. M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm problems, Advances in Cryptology-CRYPTO'85 Proceedings (Springer Lecture Notes in Computer Science 218, 1986), 516–522.Google Scholar
  3. 3.
    S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms in GF(p) and its cryptographic significance, IEEE Trans. Info. Theory 24 (1978), 106–111.CrossRefGoogle Scholar
  4. 4.
    D. R. Smith and J. T. Palmer, Universal fixed messages and the Rivest-Shamir-Adleman cryptosystem, Mathematika 26 (1979), 44–52.Google Scholar
  5. 5.
    D. Naccache and J. Stern, A new public-key encryption scheme, presentation at Luminy, September 1995.Google Scholar
  6. 6.
    J. von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987), 77–89.CrossRefGoogle Scholar
  7. 7.
    D. Weber, Discrete logarithms mod p, e-mail announcement, October 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Thomas W. Cusick
    • 1
  1. 1.Department of MathematicsState University of New York at BuffaloBuffalo

Personalised recommendations