Foiling birthday attacks in length-doubling transformations
From MaRDI portal
Recommendations
Cited in
(25)- Short variable length domain extenders with beyond birthday bound security
- Deterministic encryption with the Thorp shuffle
- Tight security of cascaded LRW2
- Hardness-preserving reductions via cuckoo hashing
- How to build optimally secure PRFs using block ciphers
- On fast and provably secure message authentication based on universal hashing
- A Proof of Security in O(2 n ) for the Benes Scheme
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Generic Attacks on Feistel Networks with Internal Permutations
- Building Secure Block Ciphers on Generic Attacks Assumptions
- The “Coefficients H” Technique
- FSBday
- Cryptanalysis of Ladder-DES
- On the security of remotely keyed encryption
- About Feistel schemes with six (or more) rounds
- New Constructions for Secure Hash Functions
- Mathematical analysis and simulation of multiple keys and S-boxes in a multinode network for secure transmission
- Pseudorandom functions: three decades later
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- Multilane HMAC— Security beyond the Birthday Limit
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Towards optimally secure deterministic authenticated encryption schemes
- Classical and quantum generic attacks on 6-round Feistel schemes
- Building a BBB pseudorandom permutation using Lai-Massey networks
This page was built for publication: Foiling birthday attacks in length-doubling transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876910)
