Weakness in quaternion signatures

2Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free