CSE 107 Lecture 5: L5 10/8/18
8 Oct 2018
School
Department
Course
Professor
Document Summary
You can actually decipher the key from looking in the cache. Aes-ni: hardware for aes (specialized instructions), that make running aes extremely fast! Best known kr attack [bokhre11] takes 2126. 1 time, which is only marginally better than the. There are attacks on reduced-round versions of aes. For example, define e: {0,1}128 x {0,1}256 {0,1}256 by. This is secure against key-recovery as aes, but not a good blockcipher b/c half the message is in the clear! Security against kr is not, as a block-cipher property, sufficient for security of uses of the block cipher. We want to know what properties of a block cipher give us security when the block cipher is used! Hard to find m given c = ek(m) We want a single master property of a block cipher. A program is intelligent if it mimics the behavior of humans! Game randr // here r is a set. If t[x] = then t[x] $ r.
