Fast correlation attacks through reconstruction of linear polynomials

DOI10.1007/3-540-44598-6_19MaRDI QIDQ4536809zbMATH OpenFDO

Authors Thomas Johansson, Fredrik Jonsson

Publication date 7 October 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44598-6_19

zbMATH Keywords

correlation attackslearning theoryreconstruction of polynomialsstream ciphers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Fast correlation attacks: an algorithmic point of view
• Applied Cryptography and Network Security
• On a fast correlation attack on certain stream ciphers
• Fast Correlation Attacks: Methods and Countermeasures
• A survey on fast correlation attacks

Cited in

(26)

• Cryptanalysis of an E0-like combiner with memory
• A fast correlation attack on LILI-128
• Practical cryptanalysis of Bluetooth encryption with condition masking
• A generic method for investigating nonsingular Galois NFSRs
• Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G
• Correlation attacks on combination generators
• A survey on fast correlation attacks
• Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
• A new method to construct Boolean functions with good cryptographic properties
• A necessary and sufficient condition for a class of nonsingular Galois NFSRs
• Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V
• New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
• Fast Correlation Attacks: Methods and Countermeasures
• A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
• Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
• Improved multi-pass fast correlation attacks with applications
• The Stream Cipher HC-128
• Cube Attacks on Tweakable Black Box Polynomials
• An Improved Fast Correlation Attack on Stream Ciphers
• Attacks against filter generators exploiting monomial mappings
• Discrete optimisation and fast correlation attacks
• Fast Software Encryption
• GL-S-NFSR: a new NFSR structure and its period properties
• Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers
• On the cycle structure of a class of Galois NFSRs: component sequences possessing identical periods
• Developments in secure random number generators

This page was built for publication: Fast correlation attacks through reconstruction of linear polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536809)