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)

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

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)