A Comparative Study of Post-Quantum Cryptographic Algorithms Assessing Security and Performance Trade-offs

Lattice-based cryptography is encryption that uses lattice issues as the basis of a conjecture of the complexity of the worst-case problem. This complexity is considered hard in the world of classical and quantum providing for a primitives design of lattice-based cryptography algorithms. The NIST held a contest to find the best algorithm to implement. This paper compares three finalists of that contest by analyzing the theoretical basis of the lattice problems they hold, with the security of the worst case of the attack through some algorithms, lattices with underlying problems, construction of cryptographic algorithms, and comparative analysis of three finalists of the lattice schemes of the NIST competition. Comparison includes the safety and robustness of the lattice problem used the cryptographic algorithm that is built and finally there will be an analysis in a computational time context to discuss the efficiency algorithm created. Two advantages and disadvantages of each the algorithm finalist are implemented and also described.