Decorrelation theory

This article is about decorrelation in cryptography. For decorrelation in general, see Decorrelation.

In cryptography, decorrelation theory is a system developed by Serge Vaudenay for designing block ciphers to be provably secure against differential cryptanalysis, linear cryptanalysis, and even undiscovered cryptanalytic attacks meeting certain broad criteria. Ciphers designed using these principles include COCONUT98 and the AES candidate DFC, both of which have been shown to be vulnerable to some forms of cryptanalysis not covered by the theory.

References

• Serge Vaudenay (February 1998). "Provable Security for Block Ciphers by Decorrelation" (PostScript). 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS '98). Paris: Springer-Verlag. pp. 249–275. http://lasecwww.epfl.ch/pub/lasec/doc/Vau98a.ps. Retrieved 26 February 2007. 
• Lars Knudsen and Vincent Rijmen (March 1999). "On the Decorrelated Fast Cipher (DFC) and Its Theory" (PostScript). 6th International Workshop on Fast Software Encryption (FSE '99). Rome: Springer-Verlag. pp. 81–94. http://www.cosic.esat.kuleuven.be/publications/article-367.ps. Retrieved 26 February 2007. 
• Serge Vaudenay (May 1999). "Resistance Against General Iterated Attacks" (PDF/PostScript). Advances in Cryptology — EUROCRYPT '99. Prague: Springer-Verlag. pp. 255–271. http://citeseer.ist.psu.edu/vaudenay98resistance.html. Retrieved 21 August 2007. 
• Serge Vaudenay (September 2003). "Decorrelation: A Theory for Block Cipher Security" (PDF). Journal of Cryptology 16 (4): 249–286. doi:10.1007/s00145-003-0220-6. ISSN 0933-2790. http://lasecwww.epfl.ch/pub/lasec/doc/Vau03b.pdf. Retrieved 26 February 2007. 

External links

• Introduction to Decorrelation Theory Online manual by Serge Vaudenay