Cryptanalysis of the quaternion rainbow

2Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Rainbow is one of the signature schemes based on multivariate problems. While its signature generation and verification are fast and the security is presently sufficient under suitable parameter selections, the key size is relatively large. Recently, Quaternion Rainbow - Rainbow over quaternion ring - was proposed by Yasuda, Sakurai and Takagi (CT-RSA'12) to reduce the key size of Rainbow without impairing the security. However, a new vulnerability emerges from the structure of quaternion ring; in fact, Thomae (SCN'12) found that Quaternion Rainbow is less secure than the same-size original Rainbow. In the present paper, we further study the security of Quaternion Rainbow and get better security results than Thomae's ones. Especially, we find that Quaternion Rainbow over even characteristic field, whose security level is estimated as about the original Rainbow of at most 3/4 by Thomae's analysis, is almost as secure as the original Rainbow of at most 1/4-size. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Hashimoto, Y. (2013). Cryptanalysis of the quaternion rainbow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8231 LNCS, pp. 244–257). https://doi.org/10.1007/978-3-642-41383-4_16

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