HW1 - Show that a pseudorandom permutation P is not...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 1 (Due in Class, Feb 14 Thursday) 1. Design a good chaining mode. Describe your encryption and decryption algorithms in detail. 2. Consider CFB mode with n=64 and s=8. If a bit error occurs in the transmission of a ciphertext block, how far does the error propagate in the worst case? 3. (Extra credit. You are NOT required to do this question.)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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/(|D|-10)+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.

Ask a homework question - tutors are online