Cryptanalysis of Polynomial Authentication and Signature Scheme
Conference Proceeding Article
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.
Cryptography, Network security, Polynomials, Security of data, Hard problems, Polynomial evaluation, Public key authentication, Public keys, Signature Scheme
Information Security and Privacy: 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000: Proceedings
City or Country
WU, Hongjun; BAO, Feng; YE, Dingfeng; and DENG, Robert H..
Cryptanalysis of Polynomial Authentication and Signature Scheme. (2000). Information Security and Privacy: 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000: Proceedings. 1841, 278-288. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1110