You are currently browsing the tag archive for the ‘Luby-Rackoff’ tag.
Scribed by Anupam Prakash
Summary
Today we finish the analysis of a construction of a pseudorandom permutation (block cipher) given a pseudorandom function.
Scribed by Siu-Man Chan
Summary
Given one way permutations (of which discrete logarithm is a candidate), we know how to construct pseudorandom functions. Today, we are going to construct pseudorandom permutations (block ciphers) from pseudorandom functions.
Today we finish the analysis of a construction of a pseudorandom permutation (block cipher) given a pseudorandom function.
Summary
Today we give a construction of a pseudorandom permutation (block cipher) given a pseudorandom function, and we begin its analysis. Read the rest of this entry »
Recent Comments