IACR Cryptology ePrint Archive · 2009 · 63 citations · 8 references
Natural SciencesComputer ScienceMathematicsCombinatoricsCryptographyTheory Of ComputationBoolean AlgebraBoolean OperationsBoolean Function RepresentationBoolean FunctionsCryptanalysisDifference SetsLinear CryptanalysisNonlinearity
Abstract. Boolean bent functions were introduced by Rothaus (1976) as combinatorial objects related to difference sets, and have since enjoyed a great popularity in symmetric cryptography and low correlation sequence design. In this paper direct links between Boolean bent functions, generalized Boolean bent functions (Schmidt, 2006) and quaternary bent functions (Kumar, Scholtz, Welch, 1985) are explored. We also study Gray images of bent functions and notions of generalized nonlinearity for functions that are relevant to generalized linear cryptanalysis.
8
O. S. Rothaus · Journal of Combinatorial Theory Series A · 1976 · 1.3K citations
Claude Carlet, Cunsheng Ding · Journal of Complexity · 2004 · 242 citations
Yuliang Zheng, Xian-Mo Zhang · IEEE Transactions on Information Theory · 2001 · 115 citations · Full text