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

	Format-Preserving Encryption Mihir Bellare1 , Thomas Ristenpart1 , Phillip Rogaway2 , and Till Stegers2 1 Dept. of Computer Science & Engineering, UC San Diego, La Jolla, CA 92093, USA 2 DocID: 1qY1X - View Document
	Proceedings - NN - RFIDSec08 DocID: 1qGBX - View Document
	D:/Documents/Courses/Winter 2014/aez/rae.dvi DocID: 1qyAn - View Document
	On Generalized Feistel Networks Viet Tung Hoang and Phillip Rogaway Dept. of Computer Science, University of California, Davis, USA Abstract. We prove beyond-birthday-bound security for most of the well-known types of ge DocID: 1q88i - View Document
	A Formal Treatment of Remotely Keyed Encryption? Matt Blaze1 Joan Feigenbaum1 Moni Naor2 AT&T Labs { Research 180 Park Avenue Florham Park, NJUSA DocID: 1pT7s - View Document