Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
From MaRDI portal
Publication:269570
DOI10.1007/s12095-015-0170-5zbMath1338.94074OpenAlexW2228658617WikidataQ114221279 ScholiaQ114221279MaRDI QIDQ269570
Georgi Ivanov, Svetla Nikova, Nikolay I. Nikolov
Publication date: 19 April 2016
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0170-5
Related Items (12)
Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups ⋮ An STP-based model toward designing S-boxes with good cryptographic properties ⋮ Unnamed Item ⋮ On the construction of hardware-friendly \(4\times4\) and \(5\times5\) S-boxes ⋮ Unnamed Item ⋮ S-boxes from binary quasi-cyclic codes ⋮ On derivatives of polynomials over finite fields through integration ⋮ О разностных свойствах симметричного криптоалгоритма, основанного на псевдодинамических подстановках ⋮ Анализ влияния линейной избыточности в S-боксах на аффинную эквивалентность в раундовых функциях XSL-схем ⋮ $\otimes_{\mathbf{W}}$-марковость XSL-алгоритмов блочного шифрования, связанная со свойствами слоев раундовой функции ⋮ The change in linear and differential characteristics of substitution after the multiplication by transposition ⋮ Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
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
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- On ``bent functions
- Relating differential distribution tables to other properties of substitution boxes
- The designs of S-boxes by simulated annealing
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Fast Low Order Approximation of Cryptographic Functions
- Communication Theory of Secrecy Systems*
- Perfect nonlinear S-boxes
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Design principles for dedicated hash functions
- Impact of Sboxes Size upon Side Channel Resistance and Block Cipher Design
- Метод генерации сильно нелинейных S-блоков на основе градиентного спуска
- Low order approximation of cipher functions
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- Fast Software Encryption
- More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
This page was built for publication: Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
