Plain versus randomized cascading-based key-length extension for block ciphers

DOI10.1007/978-3-642-40041-4_30MaRDI QIDQ2845694zbMATH OpenOpenAlexFDO

Authors Peter Gaži

Publication date 2 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

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

zbMATH Keywords

block cipherscascadeideal-cipher modelkey-length extensionprovable securityXOR-cascade

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient and optimally secure key-length extension for block ciphers via randomized cascading
• Relaxing full-codebook security: a refined analysis of key-length extension schemes
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
• Cascade Encryption Revisited
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security

Cited in

(9)

• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Key alternating ciphers based on involutions
• Minimizing the two-round Even-Mansour cipher
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Efficient and optimally secure key-length extension for block ciphers via randomized cascading
• Relaxing full-codebook security: a refined analysis of key-length extension schemes
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
• The Multi-user Security of Double Encryption
• Upper bound on information-theoretic security of permutation-based pseudorandom functions

This page was built for publication: Plain versus randomized cascading-based key-length extension for block ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845694)