论文信息 - Efficient Signature Schemes Based on Polynomial Equations

Efficient Signature Schemes Based on Polynomial Equations

Signatures based on polynomial equations modulo n have been introduced by Ong, Schnorr, Shamir [3]. We extend the original binary quadratic OSS-scheme to algebraic integers. So far the generalised scheme is not vulnerable by the recent algorithm of Pollard for solving s 1 2 + k s 2 2 = m (mod n) which has broken the original scheme.

[1] Warren Bower. New directions , 1937 .

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

[3] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

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

[5] Claus-Peter Schnorr,et al. Signatures through Approximate Representation by Quadratic Forms , 1983, CRYPTO.

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

[7] David Chaum,et al. Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .