Post-Quantum Lattice-Based Cryptography Implementations

  title={Post-Quantum Lattice-Based Cryptography Implementations},
  author={Hamid Nejatollahi and Nikil D. Dutt and Sandip Ray and Francesco Regazzoni and Indranil Banerjee and Rosario Cammarota},
  journal={ACM Computing Surveys (CSUR)},
  pages={1 - 41}
The advent of quantum computing threatens to break many classical cryptographic schemes, leading to innovations in public key cryptography that focus on post-quantum cryptography primitives and protocols resistant to quantum computing threats. Lattice-based cryptography is a promising post-quantum cryptography family, both in terms of foundational properties as well as in its application to both traditional and emerging security problems such as encryption, digital signature, key exchange, and… 

Figures and Tables from this paper

Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
  • R. Asif
  • Computer Science, Mathematics
  • 2021
The key aim of this survey was to provide the scientific community with comprehensive information on elementary mathematical facts, as well as to address real-time implementation, hardware architecture, open problems, attack vectors, and the significance for the IoT networks.
A Lightweight Post-Quantum Lattice-Based RSA for Secure Communications
A post-quantum lattice-based RSA (LB-RSA) for IoT-based cloud applications to secure the shared data and information and is compared with the existing state-of-the-art techniques.
AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE
The paper aims to provide a robust key-agreement algorithm between two entities without using any reconciliation mechanism, and is capable of providing both 2 118 or 2 254 classical security and 2 102 or 2 241 quantum security.
Post Quantum Cryptographic Keys Generated with Physical Unclonable Functions
This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code-based cryptography, and allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network.
Post-Quantum Cryptography Algorithms Standardization and Performance Analysis
This paper discusses in detail the global effort for the design, development, and standardization of various quantum-safe cryptography algorithms along with the performance analysis of some of the potential quantum- safe algorithms.
Towards Practical Deployment of Post-quantum Cryptography on Constrained Platforms and Hardware-Accelerated Platforms
This paper evaluates the NIST’s PQC competition candidates with respect to their suitability for the implementation on special hardware platforms, focusing on the implementability on constrained platforms and on the performance on very fast hardware-accelerated platforms.
Reconciliation based key exchange schemes using lattices: a review
This work conducts a complete review, security analysis, implementation and comparison of these basic key exchange schemes and classify these schemes under two different categories depending on the reconciliation mechanism used by the scheme.
Incorporating post-quantum cryptography in a microservice environment
In this research, different Post-Quantum Cryptography (PQC) algorithms are tested on performance of the certificate generation, certificate signing and performing a TLS handshake with mutual authentication and it is concluded that the performance of PQC is similar to theperformance of classical cryptography.
Two Post-Quantum Signature Use-cases: Non-issues, Challenges and Potential Solutions∗
This work is evaluating two post-quantum signature use-cases and analyzes the signature schemes that seem most appropriate for them and proposes suitable parameters and shows that Hash-Based Signatures are good candidates for image signing.
Physical security in the post-quantum era
The possibility of performing side-channel analysis in the quantum world is discussed and compared to attacks launched in the classic world, and proposals for quantum random number generation and quantum physically unclonable functions are compared to their classic counterparts and further analyzed to give a better understanding of their features, advantages, and shortcomings.


Trends, challenges and needs for lattice-based cryptography implementations: special session
Trends in lattice-based cryptographic schemes, some fundamental recent proposals for the use of lattices in computer security, challenges for their implementation in software and hardware, and emerging needs are summarized.
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project
The Open Quantum Safe project is introduced, an open-source software project for prototyping quantum-resistant cryptography, which includes liboqs, a C library of quantum- resistant algorithms, and the integrations of liboq into popular open- source applications and protocols, including the widely used OpenSSL library.
spKEX: An optimized lattice-based key exchange
The advent of large-scale quantum computers has resulted in significant interest in quantum-safe cryptographic primitives. Lattice-based cryptography is one of the most attractive post-quantum
The Future of Real-Time Security
An optimization technique for lattice-based signature generation on embedded systems and can generate a signature with a latency of 96 clock cycles at 40MHz, resulting in a response time of 2.4μs for a signing request.
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
This paper introduces Kyber, a portfolio of post-quantum cryptographic primitives built around a key-encapsulation mechanism (KEM), based on hardness assumptions over module lattices, and introduces a CPA-secure public-key encryption scheme and eventually construct, in a black-box manner, CCA-secure encryption, key exchange, and authenticated-key-exchange schemes.
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem
This work demonstrates the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, and accompanies these cipher suites with a rigorous proof of security.
Time-independent discrete Gaussian sampling for post-quantum cryptography
This research proposes countermeasures against timing information leakage with FPGA-based designs of the CDT-based discrete Gaussian samplers with constant response time, targeting encryption and signature scheme parameters.
Lattice-based encryption over standard lattices in hardware
This is the first hardware architecture for standard lattice-based cryptography reported in the literature to date and thus is a benchmark for future implementations, and a revised discrete Gaussian sampler is proposed which is the fastest of its type to date, and the first to investigate the cost savings of implementing with A/2-bits of precision.
Lattice-Based Signature Schemes and Their Sensitivity to Fault Attacks
This paper investigates the vulnerability and resistance of the currently most efficient lattice-based signature schemes BLISS, ring-TESLA, and the GLP scheme and their implementations and proposes countermeasures for each of the respective attacks.
Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
This work presents an efficient and scalable micro-code engine for Ring-LWE encryption that combines polynomial multiplication based on the Number Theoretic Transform NTT,Polynomial addition, subtraction, and Gaussian sampling in a single unit.