Abstract
The signature scheme SFLASH has been accepted as candidate in the NESSIE (New European Scheme for Signatures, Integrity, and Encryption) project. We show that recovering the two secret affine mappings F37 2 → F37 2 in SFLASH can easily be reduced to the task of revealing two linear mappings F37 2 → F37 2. In particular, the 74 bits representing these affine parts do by no means contribute a factor of 274 to the effort required for mounting an attack against the system. This raises some doubts about the design of this NESSIE candidate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Bao, R. H. Deng, W. Geiselmann, C. Schnorr, R. Steinwandt, and H. Wu, Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems, in Proceedings of PKC 2001, K. Kim, ed., Lecture Notes in Computer Science, Springer, 2001.
W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, 24 (1997), pp. 235–265.
J. Patarin, N. Courtois, and L. Goubin, SFLASH, a fast asymmetric signature scheme for low-cost smartcards. Primitive specification and supporting documentation. Presented at First Open NESSIE Workshop., November 2000. At the time of writing available electronically at the http://www.cosic.esat.kuleuven.ac.be/nessie/workshop/submissions/sflash.zip.
___, FLASH, a Fast Multivariate Signature Algorithm, in Progress in Cryptology — CT-RSA 2001, D. Naccache, ed., vol. 2020 of Lecture Notes in Computer Science, Berlin; Heidelberg, 2001, Springer, pp. 298–307.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiselmann, W., Steinwandt, R., Beth, T. (2001). Attacking the Affine Parts of SFLASH. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive