Journal Article10.3390/cryptography8020021
Constrained Device Performance Benchmarking with the Implementation of Post-Quantum Cryptography
Gregory Fitzgibbon,C. Ottaviani +1 more
3
TL;DR: Constrained device benchmarking of NIST post-quantum algorithms reveals CRYSTALS-Kyber and CRYSTALS-Dilithium as the most efficient algorithms for key encapsulation and signature schemes, respectively, on constrained devices.
read more
Abstract: Advances in quantum computers may pose a significant threat to existing public-key encryption methods, which are crucial to the current infrastructure of cyber security. Both RSA and ECDSA, the two most widely used security algorithms today, may be (in principle) solved by the Shor algorithm in polynomial time due to its ability to efficiently solve the discrete logarithm problem, potentially making present infrastructures insecure against a quantum attack. The National Institute of Standards and Technology (NIST) reacted with the post-quantum cryptography (PQC) standardization process to develop and optimize a series of post-quantum algorithms (PQAs) based on difficult mathematical problems that are not susceptible to being solved by Shor’s algorithm. Whilst high-powered computers can run these PQAs efficiently, further work is needed to investigate and benchmark the performance of these algorithms on lower-powered (constrained) devices and the ease with which they may be integrated into existing protocols such as TLS. This paper provides quantitative benchmark and handshake performance data for the most recently selected PQAs from NIST, tested on a Raspberry Pi 4 device to simulate today’s IoT (Internet of Things) devices, and provides quantitative comparisons with previous benchmarking data on a range of constrained systems. CRYSTALS-Kyber and CRYSTALS-Dilithium are shown to be the most efficient PQAs in the key encapsulation and signature algorithms, respectively, with Falcon providing the optimal TLS handshake size.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Lightweight BRLWE-based Post-Quantum Cryptosystem with Side-Channel Resilience for IoT Security
Changsheng Ma,Achyut Shankar,Saru Kumari,Chien‐Ming Chen +3 more
Exploring Quantum Circuits, Quantum Cryptography and Post Quantum-Computing Using Qiskit in Python
Paras Nath Singh,Navaneetha M,Paras Nath Singh,Navaneetha M +3 more
Public Key Protocols from Twisted-Skew Group Rings
Javier de la Cruz,Edgar Martı́nez-Moro,Steven Muñoz-Ruiz,Ricardo Villanueva-Polanco +3 more
TL;DR: This article studies some algebraic structures known as twisted-skew group rings in the context of public key cryptography and introduces a key-encapsulation mechanism from a well-known generic construction applied to probabilistic public encryption.
References
On lattices, learning with errors, random linear codes, and cryptography
TL;DR: A (classical) public-key cryptosystem whose security is based on the hardness of the learning problem, which is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem that is quantum.
2.3K
Encyclopedia of Database Systems
Ling Liu,M. Tamer Zsu +1 more
TL;DR: This comprehensive reference contains 1,300 illustrated entries, organized alphabetically, providing easy access to important concepts relevant information on all aspects of very large databases, data management, and database systems, including areas of current interest and research results of historical significance.
Generating hard instances of lattice problems (extended abstract)
Miklós Ajtai
- 01 Jul 1996
TL;DR: A random class of lattices in Zn is given whose elements can be generated together with a short vector in them so that, if there is a probabilistic polynomial time algorithm which finds a long vector in a random lattice with a probability of at least ~ then there is also a prob probability-based algorithm which solves the following three lattice problems in ev-e~g lattice inZn with a probabilities exponentially close to one.
1.6K
Internet of Things security
TL;DR: This study aims to serve as a useful manual of existing security threats and vulnerabilities of the IoT heterogeneous environment and proposes possible solutions for improving the IoT security architecture.
1.2K
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Joppe W. Bos,Léo Ducas,Eike Kiltz,Tancrède Lepoint,Vadim Lyubashevsky,John M. Schanck,Peter Schwabe,Gregor Seiler,Damien Stehlé +8 more
- 24 Apr 2018
TL;DR: 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.