Unpredictable permutation

Results: 5



#Item
1Chapter 3 Pseudorandom Functions Pseudorandom functions (PRFs) and their cousins, pseudorandom permutations (PRPs), figure as central tools in the design of protocols, especially those for shared-key cryptography. At one

Chapter 3 Pseudorandom Functions Pseudorandom functions (PRFs) and their cousins, pseudorandom permutations (PRPs), figure as central tools in the design of protocols, especially those for shared-key cryptography. At one

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2009-09-20 20:41:44
2Appears in , Vol. 61, No. 3, Dec 2000, pp. 362{399. Preliminary version was in 94 , Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.

Appears in , Vol. 61, No. 3, Dec 2000, pp. 362{399. Preliminary version was in 94 , Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2001-09-12 12:24:34
3Lai-Massey Scheme and Quasi-Feistel Networks (Extended Abstract) Aaram Yun1 , Je Hong Park2 , and Jooyoung Lee2

Lai-Massey Scheme and Quasi-Feistel Networks (Extended Abstract) Aaram Yun1 , Je Hong Park2 , and Jooyoung Lee2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-09-04 12:27:38
4

PDF Document

Add to Reading List

Source URL: www.cs.ucdavis.edu

Language: English - Date: 2005-04-04 15:10:03
5

PDF Document

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2006-11-27 11:45:50