On provable security for conventional cryptography

Abstract

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.