Provable Security for Block Ciphers by Decorrelation

摘要

In this presentation we investigate a new way of protecting block ciphers against classes of attacks which is based on the notion of decorelation which is fairly connected to Carter-Wegman's notion of universal functions. This defines a simple and friendly combinatorial measurement which enables to quantify the security. We show that we can mix provable protections and heuristic protections. We finally propose two new block ciphers family we call COCONUT and PEANUT, which implement these ideas and achieve quite reasonable perofmrances for real-life applications.