7 search results - page 1 / 2 » New Construction for Balanced Boolean Functions with Very Hi... |
136
Voted
IEICET
2007
15 years 7 months ago
2007
167
click to vote
ACISP
2003
Springer
16 years 8 days ago
2003
Springer
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
224
Voted
INDOCRYPT
2005
Springer
16 years 16 days ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
210
Voted
SIAMSC
2011
15 years 2 months ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
166
click to vote
DELTA
2002
IEEE
16 years 4 hour ago
2002
IEEE
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...