
The security of lattice-based post-quantum cryptography relies on the computational hardness of the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) in lattices, which are equivalent to sphere packing and sphere covering problems, and can be formulated as arithmetic problems of positive definite quadratic forms.


coremsg

the-mathematical-foundations-of-post-quantum-cryptography


The Mathematical Foundations of Post-Quantum Cryptography


title_rewrite


This work proposes a suite of three new lattice-based key encapsulation mechanisms (KEMs) called Scabbard, which are designed to improve the efficiency and hardware-awareness of learning with rounding (LWR)-based cryptographic schemes.


efficient-and-hardware-aware-design-of-learning-with-rounding-based-key-encapsulation-mechanisms


Efficient and Hardware-Aware Design of Learning with Rounding-based Key Encapsulation Mechanisms
