论文信息 - A new authentication algorithm

A new authentication algorithm

In this work we present a new authentication algorithm with modified versions suitable for identification and signature. It uses error correcting codes and binary field arithmetic. It has the property that counterfeiting attacks are equivalent to solving NP complete problems. It is easy to implement and is economical in computing power and memory.

Sami Harari

[1] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .

[2] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[3] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[4] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[5] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.