Loading...
conference paper
Provable security for block ciphers by decorrelation
1998
15th Annual Symposium on Theoretical Aspects of Computer Science, STACS '98
In this paper we investigate a new way of protecting block ciphers against classes of attacks (including differential and linear crypt-analysis) which is based on the notion of decorrelation 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 performances for real-life applications
Loading...
Name
Vau98a.ps
Access type
openaccess
Size
311.98 KB
Format
Postscript
Checksum (MD5)
7c9798a5ae0da710fc162e4363ac73cb