Sciweavers

81 search results - page 2 / 17
» Improving Fast Algebraic Attacks
Sort
View
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
13 years 10 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
DAGSTUHL
2007
13 years 7 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
SACRYPT
2005
Springer
138views Cryptology» more  SACRYPT 2005»
13 years 11 months ago
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
An Braeken, Joseph Lano
EUROCRYPT
2000
Springer
13 years 9 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
CANS
2009
Springer
164views Cryptology» more  CANS 2009»
14 years 2 days ago
Extensions of the Cube Attack Based on Low Degree Annihilators
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei We...