Random Fault Attack against Shrinking Generator

  • Marcin Gomułkiewicz
  • Mirosław Kutyłowski
  • Paweł Wlaź
Conference paper

DOI: 10.1007/978-3-540-92862-1_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5389)
Cite this paper as:
Gomułkiewicz M., Kutyłowski M., Wlaź P. (2008) Random Fault Attack against Shrinking Generator. In: Fekete S.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2008. Lecture Notes in Computer Science, vol 5389. Springer, Berlin, Heidelberg

Abstract

We concern security of shrinking generator against fault attacks. While this pseudorandom bitstream generator is cryptographically strong and well suited for hardware implementations, especially for cheap artefacts, we show that using it for the devices that are not fault resistant is risky. That is, even if a device concerned is tamper-proof, generating random faults and analyzing the results may reveal secret keys stored inside the device.

For the attack we flip a random bit and observe propagation of errors. The attack uses peculiar properties of the shrinking generator and presents a new kind of threats for designs based on combining weaker generators. In particular, it indicates that potentially all designs based on combining LFSR generators might be practically weak due to slow propagation of errors in a single LFSR.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Marcin Gomułkiewicz
    • 1
  • Mirosław Kutyłowski
    • 1
  • Paweł Wlaź
    • 2
  1. 1.Wrocław University of TechnologyPoland
  2. 2.Lublin University of TechnologyPoland

Personalised recommendations