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 s12 + k s22 = m (mod n) which has broken the original scheme.
Cite
CITATION STYLE
Ong, H., Schnorr, C. P., & Shamir, A. (1985). Efficient Signature Schemes Based on Polynomial Equations (preliminary version). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 196 LNCS, pp. 37–46). Springer Verlag. https://doi.org/10.1007/3-540-39568-7_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
