Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
D. R. Smith and J. T. Palmer, Universal fixed messages and the Rivest-Shamir-Adleman cryptosystem, Mathematika 26 (1979), 44–52.
D. Naccache and J. Stern, A new public-key encryption scheme, presentation at Luminy, September 1995.
J. von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987), 77–89.
D. Weber, Discrete logarithms mod p, e-mail announcement, October 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cusick, T.W. (1997). A comparison of RSA and the Naccache-Stern public-key cryptosystem. In: Lomas, M. (eds) Security Protocols. Security Protocols 1996. Lecture Notes in Computer Science, vol 1189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62494-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-62494-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62494-3
Online ISBN: 978-3-540-68047-5
eBook Packages: Springer Book Archive