Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading? Peter Gaˇzi1,2 and Stefano Tessaro3,4 1 Department of Computer Science, Comenius University, Bratislava, Slovakia

First Page		Document Content
Date: 2014-06-19 17:26:59 Cryptography Advantage Block cipher Pseudorandom permutation Feistel cipher Cardinal number One-way compression function Index of cryptography articles		Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading? Peter Gaˇzi1,2 and Stefano Tessaro3,4 1 Department of Computer Science, Comenius University, Bratislava, Slovakia Add to Reading List Source URL: pub.ist.ac.at Download Document from Source Website File Size: 326,47 KB Share Document on Facebook

	An abridged version, reference [2], appears as Advances in Cryptology – CRYPTO ’02, Lecture Notes in Computer Science, Vol. ????, M. Yung, ed., Springer-Verlag. This is the full version. Black-Box Analysis of the Blo DocID: 1qpw6 - View Document
	An earlier version of this paper appeared in EurocryptSecurity/Eﬃciency Tradeoﬀs for Permutation-Based Hashing Phillip Rogaway1 and John Steinberger2 1 DocID: 1q3qz - View Document
	Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers Peter Gaˇzi ETH Zurich, Switzerland Department of Computer Science DocID: 1llOc - View Document
	Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading? Peter Gaˇzi1,2 and Stefano Tessaro3,4 1 Department of Computer Science, Comenius University, Bratislava, Slovakia DocID: 1kVR0 - View Document