A recently proposed class of multivariate Public-Key Cryptosystems, the Rainbow-Like Digital Signature Schemes, in which successive sets of central variables are obtained from previous ones by solving linear equations, seem to lead to efficient schemes (TTS, TRMS, and Rainbow) that perform well on systems of low computational resources. Recently SFLASH (C* -) was broken by Dubois, Fouque, Shamir, and Stern via a differential attack. In this paper, we exhibit similar algebraic and diffential attacks, that will reduce published Rainbow-like schemes below their security levels. We will also discuss how parameters for Rainbow and TTS schemes should be chosen for practical applications. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ding, J., Yang, B. Y., Chen, C. H. O., Chen, M. S., & Cheng, C. M. (2008). New differential-algebraic attacks and reparametrization of rainbow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5037 LNCS, pp. 242–257). https://doi.org/10.1007/978-3-540-68914-0_15
Mendeley helps you to discover research relevant for your work.