On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
From MaRDI portal
Publication:3600455
DOI10.1007/978-3-540-85912-3_31zbMath1206.94059OpenAlexW1549565053MaRDI QIDQ3600455
Publication date: 10 February 2009
Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_31
covering radiuscryptographyblock cipherReed-Muller codeBoolean functionstream cipherS-boxhigher-order nonlinearity
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (4)
On the global avalanche characteristics between two Boolean functions and the higher order nonlinearity ⋮ \(r\)-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm ⋮ Unnamed Item ⋮ Algorithm 959
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Nonlinearities of S-boxes
- List decoding of the first-order binary Reed-Muller codes
- Propagation characteristics of \(x\mapsto x^{-1}\) and Kloosterman sums
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- An upper bound for the extended Kloosterman sums over Galois rings
- Non-Linear Approximations in Linear Cryptanalysis
- Fast Low Order Approximation of Cryptographic Functions
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
- Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
- A Method of Construction of Balanced Functions with Optimum Algebraic Immunity
- Communication Theory of Secrecy Systems*
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Low order approximation of cipher functions
- Advances in Cryptology - EUROCRYPT 2004
- On the Algebraic Immunity of Symmetric Boolean Functions
- How Far Can We Go Beyond Linear Cryptanalysis?
- Fast Software Encryption
- On the weight structure of Reed-Muller codes
- Fast Software Encryption
- On the Higher Order Nonlinearities of Algebraic Immune Functions
- On Exact Algebraic [Non-Immunity of S-Boxes Based on Power Functions]
- Bounds for exponential sums
This page was built for publication: On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
