Generating and counting binary bent sequences

DOI10.1109/18.57222MaRDI QIDQ3986491zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(11)

• One sufficient and necessary condition on balanced Boolean functions with \(\sigma_{f} = 2^{2n} + 2^{n+3}\) \((n \geq 3)\)
• The autocorrelation distribution of balanced Boolean function
• Characteristics in highly nonlinear functions
• Bent functions and random Boolean formulas
• The global avalanche characteristics of two Boolean functions and algebraic immunity
• Generalized hyper-bent functions over \(GF(p)\)
• Close Encounters with Boolean Functions of Three Different Kinds
• Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors
• On immunity against Biham and Shamir's differential cryptanalysis
• The structured design of cryptographically good s-boxes
• On the global avalanche characteristics between two Boolean functions and the higher order nonlinearity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986491)