Sciweavers

23 search results - page 1 / 5
» Algebraic Attacks and Decomposition of Boolean Functions
Sort
View
EUROCRYPT
2004
Springer
13 years 10 months ago
Algebraic Attacks and Decomposition of Boolean Functions
Willi Meier, Enes Pasalic, Claude Carlet
EUROCRYPT
2006
Springer
13 years 8 months ago
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
Frederik Armknecht, Claude Carlet, Philippe Gabori...
TIT
2008
130views more  TIT 2008»
13 years 4 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
14 years 5 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
SETA
2010
Springer
137views Mathematics» more  SETA 2010»
13 years 3 months ago
On a Conjecture about Binary Strings Distribution
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
Jean-Pierre Flori, Hugues Randriam, Gérard ...