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 - Unpredictable permutation - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2009-09-20 20:41:44 Open Document File Size: 211,86 KB Share Result on Facebook Company AES / / IndustryTerm cryptographic systems / computing / exhaustive key search / adversary algorithm / / Person Bt / / Position Advprp-cpa / PRP-CPA / CPA / / ProgrammingLanguage K / R / L / / ProvinceOrState Georgia / / Technology cryptography / adversary algorithm / randomized algorithm / Dom / / SocialTag Advantage Pseudorandom function family Pseudorandom permutation Function Permutation Randomized algorithm Unpredictable permutation Cryptography Mathematics Pseudorandomness

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 oneAdd to Reading List