Cryptology ePrint Archive: Report 2007/035

Cryptanalysis of white box DES implementations

Louis Goubin and Jean-Michel Masereel and Michael Quisquater

Abstract: Obfuscation is a method consisting in hiding information of some parts of a computer program. According to the Kerckhoffs principle, a cryptographical algorithm should be kept public while the whole security should rely on the secrecy of the key. In some contexts, source codes are publicly available, while the key should be kept secret; this is the challenge of code obfuscation. This paper deals with the cryptanalysis of such methods of obfuscation applied to the DES. Such methods, called the ``naked-DES'' and ``nonstandard-DES'', were proposed by Chow et al. in 2002. Some methods for the cryptanalysis of the ``naked-DES'' were proposed by Chow et al., Jacob et al., and Link and Neuman. In their paper, Link and Neuman proposed another method for the obfuscation of the DES. In this paper, we propose a general method that applies to all schemes. Moreover, we provide a theoretical analysis. We implemented our method with a C code and applied it successfully to thousands of obfuscated implementations of DES (both ``naked'' and ``non-standard'' DES). In each case, we recovered enough information to be able to invert the function.

Category / Keywords: Obfuscation, DRM, white-box cryptography, DES, Data Encryption Standard, Cryptanalysis

Publication Info: SAC07

Date: received 2 Feb 2007, last revised 6 Jul 2007

Contact author: Louis Goubin at prism uvsq fr

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20070706:142646 (All versions of this report)

Short URL: ia.cr/2007/035

Discussion forum: Show discussion | Start new discussion