With black-box access to the cipher being its unique requirement, Dinur and Shamirâs cube attack is a flexible cryptanalysis technique which can be applied to virtually any cipher. However, gaining a precise understanding of the characteristics that make a cipher vulnerable to the attack is still an open problem, and no implementation of the cube attack so far succeeded in breaking a real-world strong cipher. In this paper, we present a complete implementation of the cube attack on a GPU/CPU cluster able to improve state-of-the-art results against the Trivium cipher. In particular, our attack allows full key recovery up to 781 initialization rounds without brute-force, and yields the first ever maxterm after 800 initialization rounds. The proposed attack leverages a careful tuning of the available resources, based on an accurate analysis of the offline phase, that has been tailored to the characteristics of GPU computing. We discuss all design choices, detailing their respective advantages and drawbacks. Other than providing remarkable results, this paper shows how the cube attack can significantly benefit from accelerators like GPUs, paving the way for future work in the area.
|Titolo:||A novel GPU-based implementation of the cube attack preliminary results against trivium|
|Data di pubblicazione:||2017|
|Citazione:||Cianfriglia, M., Guarino, S., Bernaschi, M., Lombardi, F., & Pedicini, M. (2017). A novel GPU-based implementation of the cube attack preliminary results against trivium. In Lecture Notes in Computer Science (pp. 184-207).|
|Appare nelle tipologie:||2.1 Contributo in volume (Capitolo o Saggio)|