Multiparallel MMT: Faster ISD Algorithm Solving High-Dimensional Syndrome Decoding Problem

The hardness of the syndrome decoding problem (SDP) is primary evidence for security code-based cryptosystems, which are one finalists in a project to standardize post-quantum cryptography conducted by U.S. National Institute Standards and Technology (NIST-PQC). Information set (ISD) general term algorithms that solve SDP efficiently. In this paper, we concrete analysis time complexity latest ISD under limitation memory using estimator proposed Esser et al. As result, present theoretically nonoptimal ISDs, such as May-Meurer-Thomae (MMT) May-Ozerov, have lower than other ISDs some actual instances. Based on these facts, further studied possibility multiple parallelization first GPU algorithm MMT, multiparallel MMT algorithm. experiments, show faster existing algorithms. addition, report successful attempts 510-, 530-, 540- 550-dimensional instances Decoding Challenge contest MMT.