Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes

DOI10.1007/978-3-662-48116-5_16zbMath1382.94109OpenAlexW2240638099MaRDI QIDQ2946949

Yannick Seurin, Peter Gaži, Jooyoung Lee, Stefano Tessaro, John P. Steinberger

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-48116-5_16

zbMATH Keywords

block ciphersprovable securityideal-cipher modelkey-length extension

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ 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: Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes