Constrained Device Performance Benchmarking with the Implementation of Post-Quantum Cryptography
-
Published:2024-05-23
Issue:2
Volume:8
Page:21
-
ISSN:2410-387X
-
Container-title:Cryptography
-
language:en
-
Short-container-title:Cryptography
Author:
Fitzgibbon Gregory1, Ottaviani Carlo2ORCID
Affiliation:
1. Quantum and AI Research, Tession Ltd., Cheadle, Cheshire SK8 1PY, UK 2. Department of Computer Science & York Centre for Quantum Technologies, University of York, York YO10 5GH, UK
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.
Funder
EPSRC DSIT TMF-uplift CHEDDAR
Reference68 articles.
1. Delfs, H., and Knebl, H. (2007). Information Security and Cryptography: Texts and Monographs, Springer. [2nd ed.]. 2. Liu, L., and OZsu, M.T. (2009). Encyclopedia of Database Systems, Springer. 3. Chan, C.L., Fontugne, R., Cho, K., and Goto, S. (2018, January 15–19). Monitoring TLS adoption using backbone and edge traffic. Proceedings of the IEEE INFOCOM 2018—IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA. 4. Naylor, D., Finamore, A., Leontiadis, I., Grunenberger, Y., Mellia, M., Munafò, M., Papagiannaki, K., and Steenkiste, P. (2014, January 2–5). The Cost of the “S” in HTTPS. Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, Sydney, Australia. 5. Shor, P.W. (1994, January 20–22). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual Symposium on Foundation of Computer Science, Washington, DC, USA.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|