Foiling Birthday Attacks in Length-Doubling Transformations
From MaRDI portal
Publication:2876910
DOI10.1007/3-540-68339-9_27zbMath1304.94031OpenAlexW1523225792MaRDI QIDQ2876910
Ramarathnam Venkatesan, William Aiello
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_27
Related Items (20)
On Fast and Provably Secure Message Authentication Based on Universal Hashing ⋮ Tight security of cascaded LRW2 ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ A Proof of Security in O(2 n ) for the Benes Scheme ⋮ How to build optimally secure PRFs using block ciphers ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions ⋮ 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 ⋮ Deterministic encryption with the Thorp shuffle ⋮ Multilane HMAC— Security beyond the Birthday Limit ⋮ Generic Attacks on Feistel Networks with Internal Permutations ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions ⋮ The “Coefficients H” Technique ⋮ A Proof of Security in O(2 n ) for the Xor of Two Random Permutations ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication: Foiling Birthday Attacks in Length-Doubling Transformations
