An Analysis of Leading Lattice-Based Asymmetric Cryptographic Primitives

Cryptographic primitives have been constructed on a wide range of mathematical basis. For asymmetric cryptography, those bases are problems in number theory. Lattice based mathematical problems provide a basis for cryptographic algorithms. Lattice-based cryptographic algorithms are believed to be resistant to quantum computing attacks. This makes research concerning these algorithms important. What is lacking in the current literature is a comparative study of existing cryptanalysis data for these algorithms. That data can be used to guide further research into lattice-based asymmetric cryptographic primitives. This current paper provides such a comparison.