A fast signature scheme based on congruential polynomial operations

A novel digital signature scheme is proposed in which the computation time is much shorter than that of the Rivest-Shamir-Adelman (RSA) scheme, while the key length and signature length are comparable to those for the RSA scheme. Moreover, the proposed scheme can be implemented easily and is, therefore, more practical for many digital signature applications. The scheme is based on congruential polynomial operations whose degrees are more than three. The secret key consists of two large prime numbers, p and q, and the public key is their product, n=p/sup 2/q. The security of this scheme depends on the difficulty of factorizing the number n. Variations using the number of zeros succeeding the significant bit are also proposed. >

[1]  Adi Shamir,et al.  An efficient signature scheme based on quadratic equations , 1984, STOC '84.

[2]  Adi Shamir,et al.  An Improvement of the Fiat-Shamir Identification and Signature Scheme , 1988, CRYPTO.

[3]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[4]  Ernest F. Brickell,et al.  An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi , 1985, CRYPTO.

[5]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[6]  Jean-Jacques Quisquater,et al.  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.

[7]  Karl J. Lieberherr,et al.  Uniform Complexity and Digital Signatures , 1981, Theor. Comput. Sci..

[8]  Adi Shamir.  A Fast Signature Scheme , 1978 .

[9]  Tatsuaki Okamoto,et al.  A digital signature scheme based on polynomial operations , 1986, Systems and Computers in Japan.

[10]  E. Brickell,et al.  Cryptanalysis: a survey of recent results , 1988, Proc. IEEE.

[11]  Brigitte Vallée,et al.  How to Break Okamoto's Cryptosystem by Reducing Lattice Bases , 1988, EUROCRYPT.

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

[13]  Oded Goldreich,et al.  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme , 1986, CRYPTO.

[14]  Claus-Peter Schnorr,et al.  An efficient solution of the congruence x2+ky2=mpmod{n} , 1987, IEEE Trans. Inf. Theory.

[15]  Don Coppersmith,et al.  Another Birthday Attack , 1986, CRYPTO.

[16]  Amos Fiat,et al.  Zero Knowledge Proofs of Identity , 1987, STOC.

[17]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[18]  Dorothy E. Denning,et al.  Programming Techniques and Data Structures Digital Signatures with Rsa and Other Public.key , 2022 .

[19]  Brigitte Vallée,et al.  Computation of Approximate L-th Roots Modulo n and Application to Cryptography , 1988, CRYPTO.

[20]  Kazuo Ohta,et al.  A Modification of the Fiat-Shamir Scheme , 1988, CRYPTO.

[21]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[22]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

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