License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6117
URL: http://drops.dagstuhl.de/opus/volltexte/2006/611/
Gomulkiewicz, Marcin ; Kutylowski, Miroslaw ; Wlaz, Pawel

Fault Jumping Attacks against Shrinking Generator

pdf-format:
Dokument 1.pdf (140 KB)

Abstract

In this paper we outline two new cryptoanalytic attacks against hardware implementation of the shrinking generator by Coppersmith et al., a classic design in low-cost, simple-design pseudorandom bitstream generator. This is a report on work on progress, since implementation and careful adjusting the attack strategy in order to optimize the atatck is still not completed.

BibTeX - Entry

@InProceedings{gomulkiewicz_et_al:DSP:2006:611,
  author =	{Marcin Gomulkiewicz and Miroslaw Kutylowski and Pawel Wlaz},
  title =	{Fault Jumping Attacks against Shrinking Generator},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/611},
  annote =	{Keywords: Pseudorandom generator, shrinking generator, fault cryptanalysis}
}

Keywords: Pseudorandom generator, shrinking generator, fault cryptanalysis
Seminar: 06111 - Complexity of Boolean Functions
Issue date: 2006
Date of publication: 20.11.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI