Cryptanalysis of Polynomial Authentication and Signature Scheme
Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
7-2000
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.
Keywords
Cryptography, Network security, Polynomials, Security of data, Hard problems, Polynomial evaluation, Public key authentication, Public keys, Signature Scheme
Discipline
Information Security
Research Areas
Cybersecurity
Publication
Information Security and Privacy: 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000: Proceedings
Volume
1841
First Page
278
Last Page
288
ISBN
9783540450306
Identifier
10.1007/10718964_23
Publisher
Springer
City or Country
Berlin
Citation
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.
Available at: https://ink.library.smu.edu.sg/sis_research/1110
Copyright Owner and License
Publisher
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/10718964_23