Pseudorandom permutation

Results: 30



#Item
1HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e  Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

Add to Reading List

Source URL: www.hp-prime.de

Language: English - Date: 2014-09-09 06:12:34
2Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time Ben Morris1  Phillip Rogaway2

Sometimes-Recurse Shuffle Almost-Random Permutations in Logarithmic Expected Time Ben Morris1 Phillip Rogaway2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-04-01 23:51:51
3HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e  Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

Add to Reading List

Source URL: www.hpprime.de

Language: English - Date: 2014-09-09 06:12:34
4HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e  Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

HP Prime Technology Corner 10 The Practice of Statistics for the AP Exam, 5e Section 4-1, P. 215 TECHNOLOGY CORNER 10. Choosing an SRS on the HP Prime

Add to Reading List

Source URL: hp-prime.de

Language: English - Date: 2014-09-09 06:12:34
5On the Role of Definitions in and Beyond Cryptography Phillip Rogaway Dept. of Computer Science, University of California, Davis, California 95616, USA, and Dept. of Computer Science, Fac. of Science, Chiang Mai Universi

On the Role of Definitions in and Beyond Cryptography Phillip Rogaway Dept. of Computer Science, University of California, Davis, California 95616, USA, and Dept. of Computer Science, Fac. of Science, Chiang Mai Universi

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2005-06-19 20:47:33
6Structural Evaluation by Generalized Integral Property? Yosuke Todo NTT Secure Platform Laboratories, Tokyo, Japan

Structural Evaluation by Generalized Integral Property? Yosuke Todo NTT Secure Platform Laboratories, Tokyo, Japan

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-07-02 20:32:13
7A preliminary version of this paper appears in Fast Software Encryption - FSE 2007, Lecture Notes in Computer Science Vol. ???, pp. ?-?, ??? eds., Springer-Verlag, 2007. This is the full version. How to Enrich the Messag

A preliminary version of this paper appears in Fast Software Encryption - FSE 2007, Lecture Notes in Computer Science Vol. ???, pp. ?-?, ??? eds., Springer-Verlag, 2007. This is the full version. How to Enrich the Messag

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2007-03-26 17:44:21
8Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers Peter Gaˇzi ETH Zurich, Switzerland Department of Computer Science

Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers Peter Gaˇzi ETH Zurich, Switzerland Department of Computer Science

Add to Reading List

Source URL: pub.ist.ac.at

Language: English - Date: 2014-06-19 16:51:50
9Efficient 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

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

Language: English - Date: 2014-06-19 17:26:59
10Chapter 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