Abstract

The goal of white-box cryptography is to protect secret keys embedded in a cryptographic software deployed in an untrusted environment. In this article, we revisit state-of-the-art countermeasures employed in white-box cryptography, and we discuss possible ways to combine them. Then we analyze the different gray-box attack paths and study their performances in terms of required traces and computation time. Afterward, we propose a new paradigm for the gray-box attack against white-box cryptography, which exploits the data-dependency of the target implementation. We demonstrate that our approach provides substantial complexity improvements over the existing attacks. Finally, we showcase this new technique by breaking the three winning AES-128 white-box implementations from WhibOx 2019 white-box cryptography competition.

Highlights

  • A cryptographic software deployed in an untrusted execution environment faces risks of secret key extraction by malicious parties that might grant access to the software

  • We show that our approach can efficiently break several combinations of linear and non-linear masking in the presence of shuffling and obfuscation

  • We observe that the second combination provides stronger resistance against HO-differential computation analysis (DCA) since the correlation score is exponentially low with respect to the linear masking order

Read more

Summary

Introduction

A cryptographic software deployed in an untrusted execution environment faces risks of secret key extraction by malicious parties that might grant (full) access to the software. As explained in this paper, all three winning implementations were based on state-of-the-art white-box countermeasures, including a mix of linear and non-linear masking [BU18] together with shuffling and additional obfuscation. We recall the advanced gray-box attacks which can be used to break white-box implementations in this context, including higher-degree decoding analysis, (integrated) higher-order DCA. We analyze their (in)effectiveness against state-of-the-art countermeasures and exhibit their trace and time complexities. We apply our new data-dependency DCA, together with advanced gray-box attacks, to break the three winning implementations from WhibOx 2019.

Combination of Countermeasures
Linear Masking
Non-linear masking
Combination of Linear and Non-Linear Masking
Advanced Gray-Box Attacks
Higher-Degree Decoding Analysis
Higher-Order DCA
Integrated Higher-Order DCA
Data-Dependency HO-DCA
Data-Dependency Traces
Application to Combined Masking
Generalized Data-Dependency HO-DCA
Practical Attacks
Challenges and De-Obfuscation
De-Obfuscation
Conclusion
A Performance Score of a Challenge
Findings
B Lemma’s Proofs
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call