Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
Signatures based on polynomial equations modulo n have been introduced by Ong, Schnorr, Shamir . 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.
- 2.Ong, H. and Schnorr, C.P.: Signatures Through Approximate Representations by Quadratic Forms. Advances in Cryptology: Proceedings of Crypto 83. Plenum Publ. New York 1984, 117–132.Google Scholar
- 3.Ong, H., Schnorr, C.P., and Shamir, A.: An Efficient Signature Scheme Based on Quadratic Equations. Proceedings of 16th ACM-Symp. of Theory of Computing, Washington (1984), p. 208–216.Google Scholar
- 4.Pollard, J.M.: Solution of x2 + ky2 ≡ m (mod n), with Application to Digital Signatures. Preprint 1984.Google Scholar
- 7.Shamir, A.: Identity Based Cryptosystems & Signature Schemes. Proceedings of Crypto 84.Google Scholar