Generating and counting binary bent sequences

DOI10.1109/18.57222zbMath0739.94012OpenAlexW2091456407MaRDI QIDQ3986491

Carlisle M. Adams, Stafford E. Tavares

Publication date: 27 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.57222

Mathematics Subject Classification ID

Communication, information (94A99)

Related Items (11)

On the global avalanche characteristics between two Boolean functions and the higher order nonlinearity ⋮ Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors ⋮ Bent functions and random Boolean formulas ⋮ ONE SUFFICIENT AND NECESSARY CONDITION ON BALANCED BOOLEAN FUNCTIONS WITH σ_f = 2²ⁿ + 2ⁿ⁺³(n ≥ 3) ⋮ Generalized hyper-bent functions over \(GF(p)\) ⋮ The autocorrelation distribution of balanced Boolean function ⋮ The structured design of cryptographically good s-boxes ⋮ Close Encounters with Boolean Functions of Three Different Kinds ⋮ On immunity against Biham and Shamir's differential cryptanalysis ⋮ The global avalanche characteristics of two Boolean functions and algebraic immunity ⋮ Characteristics in highly nonlinear functions

This page was built for publication: Generating and counting binary bent sequences