Cryptanalysis of ARX-based White-box Implementations
DOI:
https://doi.org/10.46586/tches.v2023.i3.97-135Keywords:
White-box cryptography, Cryptanalysis, Algebraic attacks, Decomposition attacksAbstract
At CRYPTO’22, Ranea, Vandersmissen, and Preneel proposed a new way to design white-box implementations of ARX-based ciphers using so-called implicit functions and quadratic-affine encodings. They suggest the Speck block-cipher as an example target.
In this work, we describe practical attacks on the construction. For the implementation without one of the external encodings, we describe a simple algebraic key recovery attack. If both external encodings are used (the main scenario suggested by the authors), we propose optimization and inversion attacks, followed by our main result - a multiple-step round decomposition attack and a decomposition-based key recovery attack.
Our attacks only use the white-box round functions as oracles and do not rely on their description. We implemented and verified experimentally attacks on white-box instances of Speck-32/64 and Speck-64/128. We conclude that a single ARX-round is too weak to be used as a white-box round.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Alex Biryukov, Baptiste Lambin, Aleksei Udovenko
This work is licensed under a Creative Commons Attribution 4.0 International License.