A robust family of quantum-resistant cryptographic algorithms
based on the assumed computational complexity of certain integer lattice-related mathematical problems. Such problems underpin most NIST post-quantum competition
finalists, such as CRYSTALS-KYBER, NTRU, SABER, CRYSTALS-DILITHIUM, FALCON, as well as certain NIST post-quantum competition alternate finalists, such as FrodoKEM, NTRUprime, and the vast majority of CACR post-quantum competition
Cryptographic algorithms from this family are relatively efficient and generate medium-length keys. However, some of the encryption schemes and key-agreement protocols could potentially make errors, i.e. incorrectly decrypt data. Cryptanalysts aim at finding the optimal set of parameters, which would allow the algorithms to achieve a balance between robustness and performance, simultaneously minimizing the possibility of errors.