אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In this talk I will introduce a new kind of attack (called Cube Attack) on cryptographic schemes which can be represented by an (unknown) low degree polynomial with tweakable public variables such as a plaintext or IV and fixed secret variables such as a key. Its complexity is exponential in the degree but only polynomial in the key size, and it was successfully applied to several concrete cryptographic schemes. The talk will be self contained, requiring no prior knowledge in cryptanalysis. It is joint work with Itai Dinur.