A Quantum-Safe Public-Key-Algorithms Approach with Lattice-Based Scheme

The most challenging application of post-quantum cryptography (PQC) is the distribution of provably secure cryptographic keys and quantum-safe algorithms. Public-key Encryption (PKE), Key-establishment Mechanisms (KEM), and Digital Signature Algorithms (DSA) are necessary cryptographic mechanisms to use common encryption communication through insecure or untrusted networks. This paper proposes a provably quantum-resilient secure key agreement mechanism based on the most promising lattice-based cryptographic scheme and the Module Learning-with-Rounding (MLWR) problem. The main contribution of this paper is to construct a modified framework on classical computers for study and test-bed purposes.