Cryptanalysis of Polynomial Authentication and Signature Scheme | Zendy

Hongjun Wu | Zendy; Feng Bao | Zendy; Dingfeng Ye | Zendy; Robert H. Deng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Cryptanalysis of Polynomial Authentication and Signature Scheme

Author(s) -

Hongjun Wu,

Feng Bao,

Dingfeng Ye,

Robert H. Deng

Publication year - 2000

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-67742-9

DOI - 10.1007/10718964_23

Subject(s) - ntru , computer science , cryptanalysis , public key cryptography , signature (topology) , authentication (law) , digital signature , scheme (mathematics) , key (lock) , polynomial , merkle signature scheme , cryptosystem , theoretical computer science , computer security , blind signature , cryptography , mathematics , encryption , hash function , mathematical analysis , geometry

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research