This note continues a sequence of attempts to define efficient digital signature schemes based on low-degree polynomials, or to break such schemes. We consider a scheme proposed by Satoh and Araki (1997), which generalizes the Ong-Schnorr-Shamir scheme to the non-commutative ring of quaternions. We give two different ways to break the scheme.
CITATION STYLE
Coppersmith, D. (1999). Weakness in quaternion signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1666, pp. 305–314). Springer Verlag. https://doi.org/10.1007/3-540-48405-1_19
Mendeley helps you to discover research relevant for your work.