Tweakable Blockciphers with Asymptotically Optimal Security
From MaRDI portal
Publication:2946875
DOI10.1007/978-3-662-43933-3_8zbMath1321.94071OpenAlexW1453172084MaRDI QIDQ2946875
Rodolphe Lampe, Yannick Seurin
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_8
Related Items (15)
Impossible Differential Cryptanalysis of Reduced-Round Tweakable TWINE ⋮ Towards tight security of cascaded LRW2 ⋮ Tweak-Length Extension for Tweakable Blockciphers ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Tight security of cascaded LRW2 ⋮ How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers ⋮ \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher ⋮ Minimizing the two-round tweakable Even-Mansour cipher ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Tweaking key-alternating Feistel block ciphers ⋮ Building blockcipher from small-block tweakable blockcipher ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees ⋮ TNT: how to tweak a block cipher
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of a cipher from a single pseudorandom permutation.
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- Domain Extension for MACs Beyond the Birthday Barrier
- Lightweight Implementations of SHA-3 Candidates on FPGAs
- How to Encipher Messages on a Small Domain
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
- On Generalized Feistel Networks
- Indistinguishability Amplification
- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
- Understanding Adaptivity: Random Systems Revisited
- The Sum of CBC MACs Is a Secure PRF
- A New Variant of PMAC: Beyond the Birthday Bound
- On Tweaking Luby-Rackoff Blockciphers
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Theory of Cryptography
This page was built for publication: Tweakable Blockciphers with Asymptotically Optimal Security
