Abstract
Within the NESSIE (New European Schemes for Signatures, Integrity, and Encryption) project, the signature schemes FLASH and SFLASH have been proposed for the use on low-cost smartcards.
We show theoretically how differential power analysis (DPA) can be used to reveal the complete secret key in possible smartcard implementations of FLASH and SFLASH. To our knowledge no smartcard implementations of these schemes are available at the moment, so an experimental verification of this attack has not been done so far.
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.
References
T. Beth AND D. Gollmann, Algorithm Engineering for Public Key Algorithms, IEEE Journal on selected areas in communications, 7 (1989), pp. 458–466.
P. Kocher, J. Jaffe, AND B. Jun, Differential Power Analysis, in Advances in Cryptology-CRYPTO ’99, M. Wiener, ed., vol. 1666 of Lecture Notes in Computer Science, Springer, 1999, pp. 388–397.
J. Patarin, N. Courtois, AND L. Goubin, C * −+ and HM: Variations around two schemes of T. Matsumoto and H. Imai, in Advances in Cryptology-ASIACRYPT ’98, K. Ohta, ed., vol. 1514 of Lecture Notes in Computer Science, Berlin, 1998, Springer.
-, FLASH, 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/flash.zip .
-, 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.
U.S. Department OF Commerce, National Institute OF Standards AND Technology, FIPS PUB 180-1 SECURE HASH STANDARD, April 1995. At the time of writing available electronically at the http://csrc.nist.gov/publications/fips/fips180-1/fips180-1.pdf .
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
Steinwandt, R., Geiselmann, W., Beth, T. (2001). A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive