On Probable Security for Conventional Cryptography

Many previous results on the provable security of conventional cryptography have been published so far. We provide here handy tools based on Decorrelation Theory for dealing with them and we show how to make their proof easier. As an illustration we survey a few of these results and we (im)prove some by our technique. This paper covers results on pseudorandomness of some block cipher constructions and on message authentication code constructions.


Published in:
Second International Conference on Information Security and Cryptology, ICISC '99, 1787, 1-16
Presented at:
Second International Conference on Information Security and Cryptology, ICISC '99, Seoul, Korea, December 9-10, 1999
Year:
1999
Laboratories:




 Record created 2007-01-22, last modified 2018-03-17

n/a:
Download fulltextPS
External link:
Download fulltextURL
Rate this document:

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