Sciweavers

23 search results - page 3 / 5
» Algebraic Attacks and Decomposition of Boolean Functions
Sort
View
112
Voted
WG
2005
Springer
15 years 5 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
111
Voted
CANS
2009
Springer
164views Cryptology» more  CANS 2009»
15 years 6 months 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...
ICISC
2004
120views Cryptology» more  ICISC 2004»
15 years 1 months ago
Algebraic Attacks on Combiners with Memory and Several Outputs
Algebraic attacks on stream ciphers [14] recover the key by solving an overdefined system of multivariate equations. Such attacks can break several interesting cases of LFSR-based ...
Nicolas Courtois
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
15 years 9 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
118
Voted
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
15 years 5 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