Authors: Mihaljević, Miodrag J. 
Fossorier, Marc P. C.
Imai, Hideki
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 3857 LNCS
First page: 203
Last page: 214
Issue Date: 1-Jan-2006
Rank: M23
ISBN: 978-3-540-31424-0
ISSN: 0302-9743
DOI: 10.1007/11617983_20
This paper proposes a novel approach for cryptanalysis of certain cryptographic pseudorandom sequence (keystream) generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify time instances where certain arguments of the nonlinear function depend only on these B bits and are equal to zero. As opposed to previously reported methods, the proposed one also identifies and uses certain characteristics of the LFSM state-transition matrix in order to reduce the nonlinearity of the system of overdefined equations employed in an algebraic attack scenario, or to reduce the noise introduced by the linearization of the nonlinear function which corrupts the linear equations employed in a correlation attack scenario.
Keywords: Algebraic attacks | Cryptanalysis | Decimation | Decoding | Fast correlation attack | Keystream generators | LFSRs | Overdefined systems of nonlinear equations | State transition matrix | Stream ciphers
Publisher: Springer Link
Project: Advanced methods for cryptology and information processing 

Show full item record


checked on May 16, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.