Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters
From MaRDI portal
Publication:5071475
DOI10.4213/mvk377zbMath1486.94095OpenAlexW3213474323WikidataQ114844059 ScholiaQ114844059MaRDI QIDQ5071475
Reynier Antonio de la Cruz Jiménez
Publication date: 21 April 2022
Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mvk377
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reflection ciphers
- Orthomorphisms of abelian groups with minimum possible pairwise distances
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Two notions of differential equivalence on Sboxes
- Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication
- Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Loiss: A Byte-Oriented Stream Cipher
- A Fast and Provably Secure Higher-Order Masking of AES S-Box
- On the maximal component algebraic immunity of vectorial Boolean functions
- Orthomorphisms of Groups and Orthogonal Latin Squares. I
- Спектрально-линейный и спектрально-дифференциальный методы построения S-бокcов с близкими к оптимальным значениями криптографических параметров
- New classes of $8$-bit permutations based on a butterfly structure
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Cube Attacks on Tweakable Black Box Polynomials
- Bol loops of order pq
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- A family of trapdoor ciphers
- Higher-Order Masking Schemes for S-Boxes
- Метод генерации сильно нелинейных S-блоков на основе градиентного спуска
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Boolean Functions for Cryptography and Coding Theory
- Cryptographic Hardware and Embedded Systems - CHES 2004
- On the distance from permutations to imprimitive groups for a fixed system of imprimitivity
- On orthogonal Latin squares
- Orthomorphism graphs of groups
This page was built for publication: Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters
