This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Show that a pseudorandom permutation P is not predictable in the following sense: Given the values of P(1), P(2), , P(10), no efficient algorithm can guess P(11) with probability > 1/(D10)+0.001% when the seed length is sufficiently large....
View
Full
Document
This note was uploaded on 09/27/2010 for the course CSE 664 taught by Professor Shengzhong during the Spring '10 term at SUNY Buffalo.
 Spring '10
 SHENGZHONG
 Algorithms, Computer Security

Click to edit the document details