Performance Analysis of Post-Quantum Cryptography Algorithms for Digital Signature
Open accessAbstract
In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Post-quantum encryption algorithms must be based on math problems that would be difficult for both conventional and quantum computers to solve.
“post-quantum encryption algorithms must be based on math problems that would be difficult for both conventional and quantum computers to solve [20,21].”
From A hybrid encryption algorithm based on AES and Kyber for secure image protection in the post-quantum era (2026) · cites this paper as [20]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 16 · Cited by 52
Research works printed but not linked: 13
- Hegde, S.B.; Jamuar, A.; Kulkarni, R. Post Quantum Implications on Private and Public Key Cryptography. In Proceedings of the 2023 International Conference on Smart Systems for applications in Electrical Sciences (ICSSES), Tumakuru, India, 7-8 July 2023; pp. 1-6. [CrossRef] · DOI
- Lopez-Valdivieso, J.; Cumplido, R. Design and implementation of hardware-software architecture based on hashes for SPHINCS + . Acm Trans. Reconfigurable Technol. Syst. 2024. [CrossRef] · DOI
- Di Matteo, S.; Gerfo, M.L.; Saponara, S. VLSI Design and FPGA Implementation of an NTT Hardware Accelerator for Homomor- phic SEAL-Embedded Library. IEEE Access 2023, 11, 72498-72508. [CrossRef] · DOI
- Zhou, Z.; He, D.; Liu, Z.; Luo, M.; Choo, K.K.R. A Software/Hardware Co-Design of Crystals-Dilithium Signature Scheme. ACM Trans. Reconfigurable Technol. Syst. 2021, 14, 1-21. [CrossRef] · DOI
- Beckwith, L.; Nguyen, D.T.; Gaj, K. Hardware Accelerators for Digital Signature Algorithms Dilithium and FALCON. IEEE Des. Test 2023, 99, 1. [CrossRef] · DOI
- Mehic, M.; Niemiec, M.; Rass, S.; Ma, J.; Peev, M.; Aguado, A.; Martin, V.; Schauer, S.; Poppe, A.; Pacher, C.; et al. Quantum Key Distribution: A Networking Perspective. ACM Comput. Surv. 2020, 53, 1-41. [CrossRef] · DOI
- Bertels, K.; Sarkar, A.; Hubregtsen, T.; Serrao, M.; Mouedenne, A.A.; Yadav, A.; Krol, A.; Ashraf, I.; Almudever, C.G. Quantum Computer Architecture Toward Full-Stack Quantum Accelerators. IEEE Trans. Quantum Eng. 2020, 1, 1-17. [CrossRef] · DOI
- Hlukhov, V. Quantum-Inspired Computing: Shor's Algorithm and Euler's Totient Function. In Proceedings of the 2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), Dortmund, Germany, 7-9 September 2023; Volume 1, pp. 865-869. [CrossRef] · DOI
- Shrivastava, P.; Soni, K.K.; Rasool, A. Evolution of Quantum Computing Based on Grover's Search Algorithm. In Proceedings of the 2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), Kanpur, India, 6-8 July 2019; pp. 1-6. [CrossRef] · DOI
- Kuznetsov, A.; Kiian, A.; Pushkar'ov, A.; Mialkovskyi, D.; Smirnov, O.; Kuznetsova, T. Code-Based Schemes for Post-Quantum Digital Signatures. In Proceedings of the 2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), Metz, France, 18-21 September 2019; Volume 2, pp. 707-712. [CrossRef] · DOI
- Peng, C.; Chen, J.; Zeadally, S.; He, D. Isogeny-Based Cryptography: A Promising Post-Quantum Technique. IT Prof. 2019, 21, 27-32. [CrossRef] · DOI
- Mohan, P.V.A. Hash-based Digital Signatures-A tutorial review. In Proceedings of the 2023 IEEE International Conference on Public Key Infrastructure and its Applications (PKIA), Bangalore, India, 8-9 September 2023; pp. 1-8. [CrossRef] · DOI
- Stebila, D.; Mosca, M. Post-quantum key exchange for the Internet and the Open Quantum Safe project. In Proceedings of the Selected Areas in Cryptography (SAC) 2016, St. John's, NL, Canada, 10-12 August 2017; Lecture Notes in Computer Science; Volume 10532, pp. 1-24.
- Authors
- Opiłka, F., Niemiec, M., Gagliardi, M., & Kourtis, M. A.
- Affiliations
- AGH University of Krakow (PL)
- Scuola Superiore Sant'Anna (IT)
- National Centre of Scientific Research "Demokritos" (GR)
- Corresponding author
- Niemiec, Marcin
- Venue
- Applied Sciences
- Publisher
- MDPI AG
- Published
- 2024-06-07
- Volume
- 14
- Issue
- 12
- Pages
- 4994
- ISSN
- 2076-3417 (ISSN-L)
- OpenAlex
- W4399429707
- Cited by
- 52
- References
- 16
- Citations by year
- 2026: 21 · 2025: 29 · 2024: 2
- FWCI
- 7.67
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Applied Sciences (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- CINECA IRIS Institutional Research Information System (Sant'Anna School of Advanced Studies) (submittedVersion, other-oa)
- Funders
- AGH University of Krakow (101119547 (PQ-REACT))
- EU Horizon Europe Framework Program (101119547 (PQ-REACT))
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- post-quantum cryptography, digital signatures, CRYSTALS-Dilithium, falcons, SPHINCS+, key pair generation, signature verification, performance evaluation, RSA comparison
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
