Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
From MaRDI portal
Recommendations
- Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication
- The structured design of cryptographically good s-boxes
- A method for generation of high-nonlinear S-boxes based on gradient descent
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- Algorithm of construction of optimal according to criterion of zero correlation non-binary S-boxes
Cites work
- A method for generation of high-nonlinear S-boxes based on gradient descent
- Combinatorial properties of differentially 2-uniform substitutions
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Description of the set of permutations representable as a product of two permutations with fixed number of mobile points. II
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1189380 (Why is no real title available?)
- scientific article; zbMATH DE number 1245645 (Why is no real title available?)
- scientific article; zbMATH DE number 503330 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1107683 (Why is no real title available?)
- scientific article; zbMATH DE number 4195885 (Why is no real title available?)
- Mersenne twister
- Nonlinearities of S-boxes
- On a method of construction of orthogonal quasigroup systems by means of groups
- On a new Russian encryption standard
- On quadratic approximations in block ciphers
- On the Classification of 4 Bit S-Boxes
- On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems.
- On the matrices of transitions of differences for some modular groups
- Orthomorphism graphs of groups
- Perfect nonlinear S-boxes
- PIECEWISE-AFFINE PERMUTATIONS OF FINITE FIELDS
- PRESENT: An Ultra-Lightweight Block Cipher
- Probability distributions of correlation and differentials in block ciphers
- Provable security against a differential attack
- Quadratic approximations of the special type for the 4-bit permutations in S-boxes
- Random mappings with fixed elements
- THE NONLINEARITY INDEX FOR A PIECEWISE-LINEAR SUBSTITUTION OF THE ADDITIVE GROUP OF THE FIELD F2n
- Upper bounds of maximum values of average differential and linear characteristic probabilities of Feistel cipher with adder modulo \(2^m\)
- Дважды транзитивные XSL-семейства подстановок
- Двойственность разностного и линейного методов в криптографии
- Описание класса подстановок, представимых в виде произведения двух подстановок с фиксированным числом мобильных точек
Cited in
(22)- The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups
- Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- Comparison of random S-box generation methods
- The change in linear and differential characteristics of substitution after the multiplication by transposition
- Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes
- Optimization of the high nonlinear S-boxes generation method
- A new representation of S-boxes for algebraic differential cryptanalysis
- On differential uniformity of permutations derived using a generalized construction
- Invariant subspaces in SPN block cipher
- Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters
- A method for generation of high-nonlinear S-boxes based on gradient descent
- Bijective S-boxes of different sizes obtained from quasi-cyclic codes
- Construction methods for a class of lightweight optimal S-boxes
- Algorithm of construction of optimal according to criterion of zero correlation non-binary S-boxes
- Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
- On the difference characteristics of piecewise-linear permutations of the field \(\mathbb{F}_{2^n} \)
- On a heuristic approach to constructing bijective vector Boolean functions with given cryptographic properties
- Orthomorphisms of groups with minimal possible pairwise distances
- Adapted spectral-differential method for construction of differentially 4-uniform piecewise-linear permutations, orthomorphisms, and involutions of the field \(\mathbb{F}_{2^n} \)
- On linear equivalence of piecewise-linear permutations of the field \(\mathbb{F}_{2^n}\)
- Orthomorphisms of abelian groups with minimum possible pairwise distances
This page was built for publication: Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381882)
