Simpira v2: A Family of Efficient Permutations Using the AES Round Function
From MaRDI portal
Publication:2958116
DOI10.1007/978-3-662-53887-6_4zbMath1404.94077OpenAlexW2554299582MaRDI QIDQ2958116
Publication date: 1 February 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01403414/file/simpira.pdf
hash functionEven-Mansourcryptographic permutationsgeneralized Feistel structure (GFS)AES-NIbeyond birthday-bound (BBB) securityLamport signaturewide-block encryption
Related Items (10)
On the resilience of Even-Mansour to invariant permutations ⋮ Pholkos -- efficient large-state tweakable block ciphers from the AES round function ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ Cryptanalysis of Simpira v1 ⋮ Surnaming Schemes, Fast Verification, and Applications to SGX Technology ⋮ sLiSCP: Simeck-based permutations for lightweight sponge cryptographic primitives ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ Provable related-key security of contracting Feistel networks
Uses Software
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
- Tweakable block ciphers
- An analysis of the blockcipher-based hash functions from PGV
- Differential cryptanalysis of DES-like cryptosystems
- A construction of a cipher from a single pseudorandom permutation.
- Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
- Practical Cryptanalysis of PAES
- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
- Higher-Order Cryptanalysis of LowMC
- Indifferentiability of 8-Round Feistel Networks
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structures
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- Robust Authenticated-Encryption AEZ and the Problem That It Solves
- Structural Evaluation by Generalized Integral Property
- Ciphers for MPC and FHE
- Extended Generalized Feistel Networks Using Matrix Representation
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function
- Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: <sc>Lilliput</sc>
- Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
- Biclique Cryptanalysis of the Full AES
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- Intel’s New AES Instructions for Enhanced Performance and Security
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- PAEQ: Parallelizable Permutation-Based Authenticated Encryption
- Tweaking Even-Mansour Ciphers
- Multi-key Security: The Even-Mansour Construction Revisited
- Structural Evaluation for Generalized Feistel Structures and Applications to LBlock and TWINE
- Improving the Generalized Feistel
- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
- On Generalized Feistel Networks
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Salvaging Merkle-Damgård for Practical Applications
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Enhancing Differential-Linear Cryptanalysis
- The Wide Trail Design Strategy
- Two practical and provably secure block ciphers: BEAR and LION
- The block cipher Square
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- On Bruteforce-Like Cryptanalysis: New Meet-in-the-Middle Attacks in Symmetric Cryptanalysis
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Advances in Cryptology - CRYPTO 2003
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Progress in Cryptology - INDOCRYPT 2004
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
- Topics in Cryptology – CT-RSA 2004
- Theory of Cryptography
This page was built for publication: Simpira v2: A Family of Efficient Permutations Using the AES Round Function
