Nonlinearities of S-boxes
From MaRDI portal
Publication:865386
DOI10.1016/j.ffa.2005.07.003zbMath1122.94026OpenAlexW2068272963MaRDI QIDQ865386
Publication date: 14 February 2007
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.07.003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
MORE VECTORIAL BOOLEAN FUNCTIONS WITH UNBOUNDED NONLINEARITY PROFILE, Differential uniformity and linearity of S-boxes by multiplicative complexity, Linear codes from simplicial complexes, Characteristics of nonlinearity of vectorial functions over finite fields, Image sets of perfectly nonlinear maps, Minimal linear codes from Maiorana-McFarland functions, A New Design of Substitution Box with Ideal Strict Avalanche Criterion, Plateaued functions on finite nonabelian groups, Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions, A simple stream cipher with proven properties, A note on the minimal binary linear code, A family of distance-optimal minimal linear codes with flexible parameters, Four decades of research on bent functions, Characterizations and constructions of plateaued functions on finite abelian groups, More constructions of APN and differentially 4-uniform functions by concatenation, A new construction of highly nonlinear S-boxes, On the nonlinearity of S-boxes and linear codes, Asymptotic nonlinearity of vectorial Boolean functions, On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations, Algebraic manipulation detection codes via highly nonlinear functions, Спектрально-линейный и спектрально-дифференциальный методы построения S-бокcов с близкими к оптимальным значениями криптографических параметров, Permutations of finite fields with prescribed properties, К вопросу о приближении векторных функций над конечными полями аффинными аналогами, Several classes of polynomials with low differential uniformity over finite fields of odd characteristic
Cites Work
- Differential cryptanalysis of DES-like cryptosystems
- On ``bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Highly nonlinear mappings
- Communication Theory of Secrecy Systems*
- Perfect nonlinear S-boxes
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
