Provable security for block ciphers by decorrelation

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


Published in:
15th Annual Symposium on Theoretical Aspects of Computer Science, STACS '98, 1373, 249-275
Presented at:
15th Annual Symposium on Theoretical Aspects of Computer Science, STACS '98, Paris, France, February 25-27, 1998
Year:
1998
Laboratories:




 Record created 2007-01-18, last modified 2018-01-27

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)