Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Implementing Joux-Vitse's crossbred algorithm for solving MQ systems over F2 on GPUs

 
: Niederhagen, Ruben; Ning, Kai-Chun; Yang, Bo-Yin

:

Lange, Tanja:
Post-Quantum Cryptography. 9th International Conference, PQCrypto 2018 : Fort Lauderdale, FL, USA, April 9-11, 2018, Proceedings
Cham: Springer International Publishing, 2018 (Lecture Notes in Computer Science 10786)
ISBN: 978-3-319-79062-6 (Print)
ISBN: 978-3-319-79063-3 (Online)
ISBN: 3-319-79062-5
S.121-141
International Conference on Post-Quantum Cryptography (PQCrypto) <9, 2018, Fort Lauderdale/Fla.>
Englisch
Konferenzbeitrag
Fraunhofer SIT ()

Abstract
The hardness of solving multivariate quadratic (MQ) systems is the underlying problem for multivariate-based schemes in the field of post-quantum cryptography. The concrete, practical hardness of this problem needs to be measured by state-of-the-art algorithms and high-performance implementations. We describe, implement, and evaluate an adaption of the Crossbred algorithm by Joux and Vitse from 2017 for solving MQ systems over F2. Our adapted algorithm is highly parallelizable and is suitable for solving MQ systems on GPU architectures. Our implementation is able to solve an MQ system of 134 equations in 67 variables in 98.39 hours using one single commercial Nvidia GTX 980 graphics card, while the original Joux-Vitse algorithm requires 6200 CPU-hours for the same problem size. We used our implementation to solve all the Fukuoka Type-I MQ challenges for n ∈ {55, . . . , 74}. Based on our implementation, we estimate that the expected computation time for solving an MQ system of 80 equations in 84 variables is about one year using a cluster of 3600 GTX 980 graphics cards. These parameters have been proposed for 80-bit security by, e.g., Sakumoto, Shirai, and Hiwatari at Crypto 2011.

: http://publica.fraunhofer.de/dokumente/N-490781.html