Abstract
The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modi fied SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].
Chapter PDF
Similar content being viewed by others
References
W. Banks, D. Lieman and I. Shparlinski, “An Identification Scheme Based on Sparse Polynomials”, in Proceedings of PKC’2000, LNCS 1751, Springer-Verlag, pp. 68–74, 2000.
W. Banks, D. Lieman and I. Shparlinski, “Cryptographic Applications of Sparse Polynomials over Finite Rings”, to appear in ICISC’2000.
T. ElGamal. “A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms”. IEEE Transactions on Information Theory, 31 (1985), 469–472.
D. Grant, K. Krastev, D. Lieman and I. Shparlinski, “A Public Key Cryptosystem Based on Sparse Polynomials”, in Proceedings of an International Conference on Coding Theory, Cryptography and Related Areas, LNCS, Springer-Verlag, pp. 114–121, 2000.
J. Hoffstein, D. Lieman and J. H. Silverman, “Polynomial Rings and Efficient Public Key Authentication”, Proceedings of the International Workshop on Cryptographic Techniques and E-Commerce, pp. 7–19, M. Blum and C. H. Lee, eds., July 5-8, 1999, Hong Kong. At the time of writing also available at the URL http://www.ntru.com/technology/tech.technical.htm.
J. Hoffstein, J. Pipher and J. H. Silverman, “NTRU: A Ring Based Public Key System”, Proceedings of ANTS III, Porland (1998), Springer-Verlag.
V. Miller, “Uses of Elliptic Curves in Cryptography”, in Advances in Cryptology-Crypto’85, LNCS 218, Springer-Verlag, pp. 417–426, 1986.
R. L. Rivest, A. Shamir, and L. Adleman, “A method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Commun. ACM, vol. 21, no. 2, pp. 158–164, Feb. 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, F., Deng, R.H., Geiselmann, W., Schnorr, C., Steinwandt, R., Wu, H. (2001). Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive