Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
From MaRDI portal
(Redirected from Publication:3577971)
Recommendations
- Improved cryptanalysis of AES-like permutations
- Hyper-Sbox view of AES-like permutations: a generalized distinguisher
- Cryptanalysis of Rijndael S-box and improvement
- Cryptanalysis of AES and Camellia with related S-boxes
- Fast Software Encryption
- Cryptanalysis of PRESENT-like ciphers with secret S-boxes
- Cryptographic properties of modified AES-like S-boxes
- Toward reverse engineering on secret \(S\)-boxes in block ciphers
- Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing
- Experimental verification of super-Sbox analysis -- confirmation of detailed attack complexity
Cited in
(72)- Cryptanalysis of reduced sLiSCP permutation in sponge-hash and duplex-AE modes
- Statistical integral distinguisher with multi-structure and its application on AES-like ciphers
- On the cryptanalysis of the hash function Fugue: partitioning and inside-out distinguishers
- The \texttt{Deoxys} AEAD family
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- New representations of the AES key schedule
- The MALICIOUS framework: embedding backdoors into tweakable block ciphers
- Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks
- Thinking outside the superbox
- Distinguisher on full-round compression function of GOST R
- The rebound attack and subspace distinguishers: application to Whirlpool
- Internal differential collision attacks on the reduced-round Grøstl-0 hash function
- Perfect nonlinear functions and cryptography
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Constructing lightweight optimal diffusion primitives with Feistel structure
- Improved rebound attacks on AESQ: core permutation of CAESAR candidate PAEQ
- Wide Trail Design Strategy for Binary MixColumns
- Improved analysis of ECHO-256
- Nimix : An involutary nonlinear vectorial Boolean function
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Multiple limited-birthday distinguishers and applications
- Simpira v2: a family of efficient permutations using the AES round function
- Analysis of Reduced-SHAvite-3-256 v2
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Meet-in-the-middle preimage attacks on AES hashing modes and an application to Whirlpool
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- Hyper-Sbox view of AES-like permutations: a generalized distinguisher
- Non-full-active Super-Sbox analysis: applications to ECHO and Grøstl
- Implementation of symmetric algorithms on a synthesizable 8-bit microcontroller targeting passive RFID tags
- Subspace distinguisher for 5/8 rounds of the ECHO-256 hash function
- Experimental verification of super-Sbox analysis -- confirmation of detailed attack complexity
- Boomerang Distinguisher for the SIMD-512 Compression Function
- Related-Key Cryptanalysis of Midori
- Cryptanalysis of reduced-round Whirlwind
- Cryptanalysis of full \texttt{RIPEMD-128}
- LHash: a lightweight hash function
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Practical free-start collision attacks on 76-step SHA-1
- Improved differential attacks for ECHO and Grøstl
- Improved cryptanalysis of the reduced Grøstl compression function, ECHO permutation and AES block cipher
- Cryptanalysis of GOST R hash function
- Strengthening the known-key security notion for block ciphers
- Analysis of the Kupyna-256 Hash Function
- Improved cryptanalysis of AES-like permutations
- Cryptanalysis of \textsc{FlexAEAD}
- Improving the security and efficiency of block ciphers based on LS-designs
- ОБЗОР АТАК НА AES-128: К ПЯТНАДЦАТИЛЕТИЮ СТАНДАРТА AES
- An automated evaluation tool for improved rebound attack: new distinguishers and proposals of shiftbytes parameters for Grøstl
- Improved attacks against reduced-round Whirlwind
- Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing
- Triangulating rebound attack on AES-like hashing
- Quantum impossible differential attacks: applications to AES and SKINNY
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- Improved truncated differential distinguishers of AES with concrete S-box
- Improved meet-in-the-middle attack on 10 rounds of the AES-256 block cipher
- Meet-in-the-middle attacks on AES with value constraints
- Automated-based rebound attacks on ACE permutation
- Improved meet-in-the-middle attacks on nine rounds of the AES-192 block cipher
- Diving deep into the preimage security of AES-like hashing
- New representations of the AES key schedule
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- The state-test technique on differential attacks: a 26-round attack on Craft and other applications
- Scrutinizing the security of AES-based hashing and one-way functions
- Guess-and-determine rebound: applications to key collisions on \textsf{AES}
- The window heuristic: automating differential trail search in ARX ciphers with partial linearization trade-offs
- Key collisions on AES and its applications
- Revisiting Gilbert's known-key distinguisher
- Weak-key distinguishers for AES
- Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
- Collision attack on \({\mathtt Grindahl}\)
This page was built for publication: Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577971)