Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
Author:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 551-570
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On the Indifferentiability of Key-Alternating Ciphers2013
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations2012
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems2012
- Cascade Encryption RevisitedLecture Notes in Computer Science, 2009
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs2006
- A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications2003
- Security amplification by composition: The case of doubly-iterated, ideal ciphers1998
- A construction of a cipher from a single pseudorandom permutationJournal of Cryptology, 1997
- On the power of cascade ciphersACM Transactions on Computer Systems, 1985
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardComputer, 1977