Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading

DOI10.1007/978-3-642-29011-4_6zbMath1290.94076OpenAlexW163056614MaRDI QIDQ2894401

Stefano Tessaro, Peter Gaži

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_6

zbMATH Keywords

block ciphersprovable securitycascade encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Minimizing the two-round Even-Mansour cipher ⋮ The Multi-user Security of Double Encryption ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security

This page was built for publication: Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading