Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06111.7
URN: urn:nbn:de:0030-drops-6117
URL: https://drops.dagstuhl.de/opus/volltexte/2006/611/
Gomulkiewicz, Marcin ; Kutylowski, Miroslaw ; Wlaz, Pawel
Fault Jumping Attacks against Shrinking Generator
| pdf-format: |
|
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:DagSemProc.06111.7,
author = {Gomulkiewicz, Marcin and Kutylowski, Miroslaw and Wlaz, Pawel},
title = {{Fault Jumping Attacks against Shrinking Generator}},
booktitle = {Complexity of Boolean Functions},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/611},
URN = {urn:nbn:de:0030-drops-6117},
doi = {10.4230/DagSemProc.06111.7},
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 |
