Decimation Attack of Stream Ciphers

Authors:
Eric Filiol
Affiliations:
-
Venue:
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Year:
2000

Citing 10
Cited 2

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Introduction to finite fields and their applications

Introduction to finite fields and their applications
Fast correlation attacks on certain stream ciphers

Journal of Cryptology
A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Fast Correlation Attacks Based on Turbo Code Techniques

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Correlation Attacks on Stream Ciphers: Computing Low-Weight Parity Checks Based on Error-Correcting Codes

Proceedings of the Third International Workshop on Fast Software Encryption
Decrypting a Class of Stream Ciphers Using Ciphertext Only

IEEE Transactions on Computers
On a fast correlation attack on certain stream ciphers

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Improved fast correlation attacks on stream ciphers via convolutional codes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Improved fast correlation attacks using parity-check equations of weight 4 and 5

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

A New Ultrafast Stream Cipher Design: COS Ciphers

Proceedings of the 8th IMA International Conference on Cryptography and Coding
Parallel Generation of l-Sequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new attack called 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 significant improvements of all the previous known correlation and fast correlation attacks. A new criterion on the length of the polynomial is then defined to resist to the decimation attack. Simulation results and complexity comparison are detailed for ciphertext only attacks.