Sciweavers

3 search results - page 1 / 1
» Minimum Distance between Bent and 1-Resilient Boolean Functi...
Sort
View
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
13 years 10 months 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
EUROCRYPT
2001
Springer
13 years 9 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
DCC
2008
IEEE
14 years 4 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
Sumanta Sarkar, Subhamoy Maitra