Abstract
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 21 + k s 22 = m (mod n) which has broken the original scheme.
Chapter PDF
Similar content being viewed by others
References
Diffie, W. and Hellman, M.: New Directions in Cryptography. IEEE, IT-22, (1976), 644–654.
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.
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.
Pollard, J.M.: Solution of x2 + ky2 ≡ m (mod n), with Application to Digital Signatures. Preprint 1984.
Rabin, M.O.: Probabilistic Algorithms in Finite Fields. SIAM J. on Computing 9 (1980), p. 273–280.
Rivest, R.L., Shamir, A. and Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Comm. ACM 21 (1978) 120–126.
Shamir, A.: Identity Based Cryptosystems & Signature Schemes. Proceedings of Crypto 84.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ong, H., Schnorr, C.P., Shamir, A. (1985). Efficient Signature Schemes Based on Polynomial Equations (preliminary version). In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive