New classes of 8-bit permutations based on a butterfly structure
From MaRDI portal
Recommendations
- A note on ``Cryptographically strong permutations from the butterfly structure
- Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters
- Cryptographically strong permutations from the butterfly structure
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- If a generalised butterfly is APN then it operates on 6 bits
Cites work
- A family of difference sets in non-cyclic groups
- Block ciphers that are easier to mask: how far can we go?
- Ciphertext-only attack on Akelarre
- Communication Theory of Secrecy Systems*
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Enabling 3-share threshold implementations for all 4-bit S-boxes
- Fast Software Encryption
- Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication
- Handbook of Bioinspired Algorithms and Applications
- scientific article; zbMATH DE number 5831605 (Why is no real title available?)
- scientific article; zbMATH DE number 1455087 (Why is no real title available?)
- scientific article; zbMATH DE number 1418242 (Why is no real title available?)
- LS-designs: bitslice encryption for efficient masked software implementations
- New block encryption algorithm MISTY
- Reverse-engineering the S-Bbox of Streebog, Kuznyechik and Stribobr1
- The whirlpool secure hash function
Cited in
(14)- A note on ``Cryptographically strong permutations from the butterfly structure
- If a generalised butterfly is APN then it operates on 6 bits
- Построение подстановок пространства $V_{2m}$ с использованием $(2m,m)$-функций
- Об алгебраической степени и дифференциальной равномерности подстановок пространства $V_{2m}$, построенных с использованием $(2m,m)$-функций
- 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
- On the Sixth International Olympiad in Cryptography NSUCRYPTO
- On nonlinearity of Boolean functions generated by the generalized Dobbertin construction
- Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
- scientific article; zbMATH DE number 7762727 (Why is no real title available?)
- On the way of constructing differentially \(2\delta \)-uniform permutations over \(\mathbb{F}_{2^{2m}} \)
- MKV: a new block cipher for the post-quantum cryptography transition
- Adapted spectral-differential method for construction of differentially 4-uniform piecewise-linear permutations, orthomorphisms, and involutions of the field \(\mathbb{F}_{2^n} \)
This page was built for publication: New classes of 8-bit permutations based on a butterfly structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383078)
