Sciweavers

9 search results - page 2 / 2
» On Boolean Functions Which Are Bent and Negabent
Sort
View
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
14 years 25 days ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
AAECC
2007
Springer
194views Algorithms» more  AAECC 2007»
14 years 1 months ago
Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 Variable Boolean Functions with Nonlinearity 242
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Sy...
Selçuk Kavut, Melek D. Yücel
EUROCRYPT
2001
Springer
13 years 12 months ago
Hyper-bent Functions
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine mon...
Amr M. Youssef, Guang Gong
INDOCRYPT
2003
Springer
14 years 19 days ago
Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
Selçuk Kavut, Melek D. Yücel