Attacking the affine parts of SFLASH

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2260, Issue , 2001, Pages 355-359

  Geiselmann, Willi ^a   Steinwandt, Rainer ^a   Beth, Thomas ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

AFFINE MAPPING; LINEAR MAPPING; SIGNATURE SCHEME;

CRYPTOGRAPHY;

EID: 84946835010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45325-3_31     Document Type: Conference Paper

References (4)

1. 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.
2. W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, 24 (1997), pp. 235–265.
3. 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 URL https://www.cosic.esat. kuleuven.ac.be/nessie/workshop/submissions/ sflash.zip.
4. J. Patarin, 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.