Information-Theoretic Approach to Optimal Differential Fault Analysis

• Published in: IEEE transactions on information forensics and security 2012-02, Vol.7 (1), p.109-120
• Main Authors: Sakiyama, K., Li, Y., Ohta, K., Iwamoto, M.
• Format: Article
• Language: English
• Subjects: Advanced encryption standard (AES); Algorithm design and analysis; Complexity theory; differential fault analysis (DFA); Doped fiber amplifiers; Encryption; information leakage; Leaking of information; Timing; Upper bound
• ISSN: 1556-6013; 1556-6021
• DOI: 10.1109/TIFS.2011.2174984

This paper presents a comprehensive analysis of differential fault analysis (DFA) attacks on the Advanced Encryption Standard (AES) from an information-theoretic perspective. Injecting faults into cryptosystems is categorized as an active at tack where attackers induce an error in operations to retrieve the secret internal information, e.g., the secret key of ciphers. Here, we consider DFA attacks as equivalent to a special kind of passive attack where attackers can obtain leaked information without measurement noise. The DFA attacks are regarded as a conversion process from the leaked information to the secret key. Each fault model defines an upper bound for the amount of leaked information. The optimal DFA attacks should be able to exploit fully the leaked information in order to retrieve the secret key with a practical level of complexity. This paper discusses a new DFA methodology to achieve the optimal DFA attack by deriving the amount of the leaked information for various fault models from an information-theoretic perspective. We review several previous DFA at tacks on AES variants to check the optimality of their attacks. We also propose improved DFA attacks on AES-192 and AES-256 that reach the theoretical limits.