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 s12 + k s22 = m (mod n) which has broken the original scheme.
Swipe to navigate through the chapters of this book
- Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
C. P. Schnorr
- Springer Berlin Heidelberg
- Sequence number