Skip to main content
SpringerLink
Log in

Attacking the Affine Parts of SFLASH

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2260))

Included in the following conference series:

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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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 http://www.cosic.esat.kuleuven.ac.be/nessie/workshop/submissions/sflash.zip.

  4. ___, 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.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IAKS/E.I.S.S., Fakultät für Informatik, Universität Karlsruhe, Am Fasanengarten 5, 76 131, Karlsruhe, Germany

    Willi Geiselmann, Rainer Steinwandt & Thomas Beth

Authors
  1. Willi Geiselmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer Steinwandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Beth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Applied Sciences, Department of Communication Systems, Lancaster University, LA1 4YR, Lancaster, UK

    Bahram Honary

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation