Higher-Order Cryptanalysis of Block Ciphers

The theme in this thesis is design and analysis of block ciphers. Specifically, new attacks are described that successfully break cryptosystems in which the ciphertext is expressible as evaluations of some low-degree polynomial in the plaintext with a low but non-negligible probability. The attacks are particularly efficient against certain ciphers that are provably secure against differential and linear cryptanalysis.