Paper 2000/040
Decimation Attack of Stream Ciphers
Eric FILIOL
Abstract
This paper presents a new attack called {\em Decimation Attack} of most stream ciphers. It exploits the property that multiple clocking (or equivalently $d$-th decimation) of a LFSR can simulate the behavior of many other LFSRs of possible shorter length. It yields then significqnt improvements of all the previous known correlation and fast correlation attacks provided a new criterion is satisfied. This criterion on the length of the feedback polynomial is then defined to resist the decimation attack. Simulation results and complexity comparison are detailed for ciphertext only attack.
Metadata
- Available format(s)
- PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Corrected and revised version
- Keywords
- correlation attackfast correlations attacksequence decimationmultiple clocking
- Contact author(s)
- efiliol @ mailhost esm-stcyr terre defense gouv fr
- History
- 2000-09-22: last of 3 revisions
- 2000-08-07: received
- See all versions
- Short URL
- https://ia.cr/2000/040
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2000/040,
author = {Eric FILIOL},
title = {Decimation Attack of Stream Ciphers},
howpublished = {Cryptology {ePrint} Archive, Paper 2000/040},
year = {2000},
url = {https://eprint.iacr.org/2000/040}
}
