Abstract
Polynomial Authentication and Signature Scheme (PASS) is a new public key authentication and signature scheme proposed by NTRU Cryptosystems Inc. It is based on the hard problems related to constrained polynomial evaluation. In this paper, we break PASS with the proposed parameters. We show how to forge valid authentication transcripts or digital signatures in PASS with knowledge of the public key only and without knowing any previous authentication transcripts or signatures.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A New High Speed Public Key Cryptosystem, presented at the rump session of Crypto 1996 (1996) (preprint)
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring Based Public Key System. In: Proceedings of ANTS III, Porland, Springer, Heidelberg (1998)
Hoffstein, J., Lieman, D., Silverman, J.H.: Polynomial Rings and Efficient Public Key Authentication. In: Blum, M., Lee, C.H. (eds.) Proceedings of International Workshop on Cryptographic Techniques and E-Commerce, Hong Kong, July 5-8, pp. 7–19 (1999), Also available at http://www.ntru.com/ documentcenter.htm
Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU, presented at. Eurocrypt 1997, April 5 (1997) (preprint)
Hall, C., Goldberg, I., Schneier, B.: Reaction Attacks Against Several Public-Key Cryptosystems (April 1999) (preprint), available at http://www.counterpane.com
Lenstra, A.K., Lenstra Jr., H.W., Lovsz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Ann. 261, 513–634 (1982)
Schnorr, C.P.: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Proceedings of Theoretical Computer Science 53, 201–224 (1987)
Schnorr, C.P.: A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms 9, 47–62 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, H., Bao, F., Ye, D., Deng, R.H. (2000). Cryptanalysis of Polynomial Authentication and Signature Scheme. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_23
Download citation
DOI: https://doi.org/10.1007/10718964_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67742-0
Online ISBN: 978-3-540-45030-6
eBook Packages: Springer Book Archive