Performance and Memory Characterization of NIST Post-Quantum Cryptography Workloads
Resumo
The advancement of quantum computing threatens widely used public-key cryptography, motivating the post-quantum cryptography (PQC) algorithms selected by NIST for standardization. This work characterizes ML-KEM, ML-DSA, FN-DSA, SLH-DSA, and HQC using the liboqs library, evaluating execution time, key and signature sizes, stack and heap usage, sensitivity to 16 compilation configurations of the benchmark harness, and scalability with message size. ML-KEM is two to three orders of magnitude faster than HQC, ML-DSA offers the most balanced signature performance, and stack usage varies by up to 21× across families while heap peaks differ by at most 47 KiB. For large messages, signing and verification costs converge to the SHAKE-256 throughput, and harness compilation flags show no consistent effect. These results support algorithm selection across deployment scenarios.
Referências
G. Alagic, D. Apon, D. Cooper, Q. Dang, T. Dang, J. Kelsey, J. Lichtinger, C. Miller, D. Moody, R. Peralta, R. Perlner, A. Robinson, D. Smith-Tone, and Y.-K. Liu. Status report on the third round of the NIST post-quantum cryptography standardization process. NIST Interagency Report 8413-upd1, National Institute of Standards and Technology, 2022. DOI: 10.6028/NIST.IR.8413-upd1.
G. Alagic, M. Bros, P. Ciadoux, D. Cooper, Q. Dang, T. Dang, J. Kelsey, J. Lichtinger, Y.-K. Liu, C. A. Miller, D. Moody, R. Peralta, R. Perlner, A. Robinson, H. Silberg, D. Smith-Tone, and N. Waller. Status report on the fourth round of the NIST post-quantum cryptography standardization process. Technical Report NIST IR 8545, National Institute of Standards and Technology, 2025. DOI: 10.6028/NIST.IR.8545.
J. B. Almeida, M. Barbosa, G. Barthe, F. Dupressoir, and M. Emmi. Verifying Constant-Time implementations. In 25th USENIX Security Symposium (USENIX Security 16), pages 53–70, Austin, TX, Aug. 2016. USENIX Association. ISBN 978-1-931971-32-4. URL [link].
F. Arute, K. Arya, R. Babbush, et al. Quantum supremacy using a programmable superconducting processor. Nature, 574(7779):505–510, 2019. DOI: 10.1038/s41586-019-1666-5.
E. D. Demir, B. Bilgin, and M. C. Onbasli. Performance analysis and industry deployment of post-quantum cryptography algorithms, 2025. URL [link].
P.-A. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, and Z. Zhang. Falcon: Fast-fourier lattice-based compact signatures over NTRU, 2020. URL [link]. Specification v1.2, submission to the NIST Post-Quantum Cryptography Standardization Process.
M. Gabrich, H. Freitas, and M. Souza. Análise de redes neurais para crispr: Uma abordagem com computação quântica. In Anais do XXV Simpósio em Sistemas Computacionais de Alto Desempenho, pages 13–24, Porto Alegre, RS, Brasil, 2024. SBC. DOI: 10.5753/sscad.2024.244778. URL [link].
L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the ACM Symposium on Theory of Computing, STOC ’96, page 212–219, New York, NY, USA, 1996. Association for Computing Machinery. ISBN 0897917855. DOI: 10.1145/237814.237866.
National Institute of Standards and Technology. Module-lattice-based key-encapsulation mechanism standard. Federal Information Processing Standards Publication FIPS 203, U.S. Department of Commerce, 2024a. DOI: 10.6028/NIST.FIPS.203.
National Institute of Standards and Technology. Module-lattice-based digital signature standard. Federal Information Processing Standards Publication FIPS 204, U.S. Department of Commerce, 2024b. DOI: 10.6028/NIST.FIPS.204.
National Institute of Standards and Technology. Stateless hash-based digital signature standard. Federal Information Processing Standards Publication FIPS 205, U.S. Department of Commerce, 2024c. DOI: 10.6028/NIST.FIPS.205.
F. Opiłka et al. Performance analysis of post-quantum cryptography algorithms for digital signature. Applied Sciences, 14(12), 2024. ISSN 2076-3417. DOI: 10.3390/app14124994. URL [link].
J. Preskill. Quantum computing in the NISQ era and beyond. Quantum, 2:79, 2018. DOI: 10.22331/q-2018-08-06-79.
M. Raavi et al. Security and performance analyses of post-quantum digital signature algorithms and their tls and pki integrations. Cryptography, 9(2), 2025. ISSN 2410-387X. DOI: 10.3390/cryptography9020038. URL [link].
O. Reparaz, J. Balasch, and I. Verbauwhede. Dude, is my code constant time? In Proceedings of the Conference on Design, Automation & Test in Europe, DATE ’17, pages 1701–1706, Leuven, BEL, 2017. European Design and Automation Association.
C. Rocha, A. Santos, and M. Souza. A systematic literature review on optimization techniques for quantum computing compilers. In Anais Estendidos do XXIV Simpósio em Sistemas Computacionais de Alto Desempenho, pages 25–32, Porto Alegre, RS, Brasil, 2023. SBC. DOI: 10.5753/wscad_estendido.2023.235804. URL [link].
P. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings of the 35th Symp. on Foundations of Computer Science, pages 124–134, 1994. DOI: 10.1109/SFCS.1994.365700.
M. Sosnowski et al. The performance of post-quantum tls 1.3. In International Conference on Emerging Networking EXperiments and Technologies, CoNEXT 2023, page 19–27, New York, NY, USA, 2023. Association for Computing Machinery. ISBN 9798400704079. DOI: 10.1145/3624354.3630585.
M. T. d. Souza, M. A. Souza, and H. C. Freitas. Quantum machine learning with enhanced autoencoders for intrusion detection. In Anais do XXVI Simpósio em Sistemas Computacionais de Alto Desempenho, pages 217–228, Porto Alegre, RS, Brasil, 2025. SBC. DOI: 10.5753/sscad.2025.16683. URL [link].
