Sciweavers

23 search results - page 4 / 5
» Algebraic Attacks and Decomposition of Boolean Functions
Sort
View
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
13 years 10 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
ACISP
2003
Springer
13 years 11 months ago
New Constructions for Resilient and Highly Nonlinear Boolean Functions
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
Khoongming Khoo, Guang Gong
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
AES
2004
Springer
151views Cryptology» more  AES 2004»
13 years 11 months ago
General Principles of Algebraic Attacks and New Design Criteria for Cipher Components
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
Nicolas Courtois
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
13 years 9 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong