Exploring parallel enumeration algorithms to improve efficiency to solve the SVP (original) (raw)

—Lattice-based cryptography methods are well known primitives from the asymmetric cryptographic primitives set. Although widely studied for decades they have gained new notoriety in the last years because it is believe in the field of cryptography that these methods can withstand attacks by upcoming quantum computers. This paper describes how we optimized the Enumeration algorithm's serial code and then we suggest a new way to parallelize it using PThreads. The results shown in the results section are very promising and show that we can obtain significant performance improvements over the said implementation.