Sciweavers

7 search results - page 1 / 2
» Correlation Attacks Using a New Class of Weak Feedback Polyn...
Sort
View
FSE
2004
Springer
115views Cryptology» more  FSE 2004»
13 years 10 months ago
Correlation Attacks Using a New Class of Weak Feedback Polynomials
In 1985 Siegenthaler introduced the concept of correlation attacks on LFSR based stream ciphers. A few years later Meier and Staffelbach demonstrated a special technique, usually ...
Håkan Englund, Martin Hell, Thomas Johansson
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson
EUROCRYPT
2000
Springer
13 years 8 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
Anne Canteaut, Michaël Trabbia
EUROCRYPT
2003
Springer
13 years 9 months ago
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
Nicolas Courtois, Willi Meier
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
13 years 11 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel