Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
From MaRDI portal
Publication:3577971
DOI10.1007/978-3-642-13858-4_21zbMATH Open1279.94077OpenAlexW1483908684MaRDI QIDQ3577971FDOQ3577971
Authors: Henri Gilbert, Thomas Peyrin 
Publication date: 13 July 2010
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13858-4_21
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 (63)
- Hyper-Sbox view of AES-like permutations: a generalized distinguisher
- The rebound attack and subspace distinguishers: application to Whirlpool
- Cryptanalysis of reduced sLiSCP permutation in sponge-hash and duplex-AE modes
- Cryptanalysis of GOST R hash function
- Weak-key distinguishers for AES
- Subspace distinguisher for 5/8 rounds of the ECHO-256 hash function
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Boomerang Distinguisher for the SIMD-512 Compression Function
- Statistical integral distinguisher with multi-structure and its application on AES-like ciphers
- Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks
- Analysis of the Kupyna-256 Hash Function
- LHash: A Lightweight Hash Function
- The MALICIOUS framework: embedding backdoors into tweakable block ciphers
- Related-Key Cryptanalysis of Midori
- Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing
- Analysis of Reduced-SHAvite-3-256 v2
- Cryptanalysis of Reduced-Round Whirlwind
- ОБЗОР АТАК НА AES-128: К ПЯТНАДЦАТИЛЕТИЮ СТАНДАРТА AES
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Cryptanalysis of full \texttt{RIPEMD-128}
- The \texttt{Deoxys} AEAD family
- Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure
- Practical Free-Start Collision Attacks on 76-step SHA-1
- Experimental verification of super-Sbox analysis -- confirmation of detailed attack complexity
- Wide Trail Design Strategy for Binary MixColumns
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- New representations of the AES key schedule
- Collision attack on \({\mathtt Grindahl}\)
- Triangulating rebound attack on AES-like hashing
- 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
- Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
- Improved Rebound Attacks on AESQ: Core Permutation of CAESAR Candidate PAEQ
- Improved cryptanalysis of AES-like permutations
- Revisiting Gilbert's known-key distinguisher
- On the cryptanalysis of the hash function Fugue: partitioning and inside-out distinguishers
- Internal differential collision attacks on the reduced-round Grøstl-0 hash function
- Distinguisher on full-round compression function of GOST R
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Improved cryptanalysis of the reduced Grøstl compression function, ECHO permutation and AES block cipher
- Nimix : An involutary nonlinear vectorial Boolean function
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- Improving the security and efficiency of block ciphers based on LS-designs
- Perfect nonlinear functions and cryptography
- Meet-in-the-middle preimage attacks on AES hashing modes and an application to Whirlpool
- Implementation of symmetric algorithms on a synthesizable 8-bit microcontroller targeting passive RFID tags
- Improved differential attacks for ECHO and Grøstl
- Non-full-active Super-Sbox analysis: applications to ECHO and Grøstl
- Improved analysis of ECHO-256
- Strengthening the Known-Key Security Notion for Block Ciphers
- Meet-in-the-middle attacks on AES with value constraints
- Improved truncated differential distinguishers of AES with concrete S-box
- Improved attacks against reduced-round Whirlwind
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- 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
- Improved meet-in-the-middle attack on 10 rounds of the AES-256 block cipher
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- New representations of the AES key schedule
- Quantum impossible differential attacks: applications to AES and SKINNY
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)
