Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Calculation

A computational benchmark of standardized lattice-based post-quantum signature schemes

Melike Karatay

Published Jan 29, 2026• 0 citations
OpenAlex

Abstract

This article provides an expanded computational evaluation of three standardized lattice-based post-quantum signature schemes—ML-DSA-44, ML-DSA-65 and Falcon-512—using reference implementations from the Open Quantum Safe (liboqs) project. Unlike prior benchmarking efforts that rely on optimized implementations or hardware-specific tuning, this work focuses on reproducible baseline performance on a conventional CPU platform. We measure key generation, signing and verification times across 5,000 iterations and analyze the effect of message length on signing cost. Results confirm that ML-DSA variants achieve significantly faster signing and key generation, whereas Falcon-512 produces substantially smaller keys and signatures. The study further highlights the computational dominance of lattice operations over hashing, explaining the weak dependence of signing cost on message size. These findings aim to support system architects evaluating the practical feasibility of standardized post-quantum signature algorithms.

Related papers

A STUDY OF POST-QUANTUM CRYPTOGRAPHIC ALGORITHMS FOR SECURE COMMUNICATION

Preeti Sharma

This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.

IJRDO-Journal of Applied Science•Jan 1, 2026•0 citations

Benchmarking NIST Post-Quantum Standards: A Comparative Performance and Bandwidth Analysis of ML-KEM, ML-DSA, and RSA-3072

Y. Nagaraju, Manoj G C, Punith kumar +3 more

The advent of large-scale, fault-tolerant quantum computers threatens the mathematical foundations - namely integer factorization and discrete-logarithm hardness - on which today's public-key cryptography relies could be rendered insecure. This has shifted the need to move to Post-Quantum Cryptography (PQC) from a theoretical to an engineering priority. This work presents an extensive empirical comparison of the NIST standardized primitives used for key encapsulation (FIPS 203: ML-KEM) and digital signatures (FIPS 204: ML-DSA) with the standardised classical RSA-3072 primitives at similar security levels as defined by the NIST security level. This paper evaluates three fundamental performance metrics: (i) computational latency in CPU clock cycles; (ii) communication cost in bytes; and (iii) memory usage during the cryptographic operation, and combines them into a unified evaluation framework. Additionally, the paper discusses the mathematical principles of the standardized quantum-resistant schemes, namely Module Short Integer Solution (MSIS) and Module Learning With Errors (MLWE) focusing on their security principles. Benchmarking reveals that, despite lattice-based schemes incurring larger public key and signature sizes-up to$32 \times$relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately$108 \times$faster than an RSA-3072 private-key operation, and ML-DSA-65 signing is approximately 19× faster than RSA-3072 signing. To support cryptographic agility during the post-quantum migration period, this paper proposes a modular hybrid architecture validated through a triple-hybrid (ECDH + Kyber + BB84 QKD) demonstration.

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)•Aug 1, 2026•0 citations

Post Quantum Security and Quantum Safe Protocols: A Survey

Md. Min-ha-zul Abedin

Large-scale quantum computers would invalidate the hardness assumptions behind many deployed public key cryptosystems and reduce the effective strength of symmetric primitives. As a result, governments and industry have begun a multi-year transition toward post quantum cryptography and quantum safe protocols. This survey provides a structured overview of that transition. It classifies the main families of post quantum schemes, with emphasis on the standardized lattice based and hash-based algorithms ML-KEM, ML-DSA, SLH-DSA, FALCON and Classic McEliece, and it summarizes their parameter sets, key sizes, ciphertext or signature lengths and performance profiles across the NIST security categories. The survey then reviews stateful hash-based signatures, multivariate and isogeny-based proposals and emerging MPC in the head constructions and discusses their security assumptions and level of maturity. At the protocol level it analyzes hybrid designs for TLS 1.3, QUIC, IPsec, SSH and public key infrastructures and draws lessons from early deployments in web, IoT, and cloud environments. By collating detailed parameter data from recent NIST standards and reference implementations and mapping them to concrete deployment scenarios, the survey links high-level policy guidance to engineering choices. The paper also synthesizes cross cutting implementation and migration challenges, including side channel resistance, cryptographic agility, asset inventory and migration planning, and algorithm diversity across deployments. Finally, it identifies open problems such as leakage resilient implementations, domain specific post quantum profiles for constrained devices and combinations of post quantum cryptography with quantum key distribution. The goal is to give researchers and practitioners a coherent reference that connects algorithms, standards, protocol mechanisms and deployment guidance for building quantum safe systems.

•Jan 27, 2026•0 citations

Evaluating X.509 Certificate Performance of NIST PQC Round 2 Additional Digital Signatures

Amrutvyasa Ramasamy, Sanketh Chapaneri, Manohar Raavi

Recent advancements in quantum computing threaten the cryptographic foundations of Public Key Infrastructure (PKI). Although the National Institute of Standards and Technology (NIST) has standardized three post-quantum digital signature algorithms, namely ML-DSA, SLH-DSA, and FALCON, fourteen additional candidates are currently under evaluation, to diversify the collection of available post-quantum signature schemes. This work presents a comprehensive performance analysis of the fourteen ‘Round 2’ digital signature candidates within a functional X. 509 PKI environment. Unlike prior studies focused on isolated benchmarking, we evaluate the complete PKI life cycle, key generation, CSR creation, as well as certificate signing and verification. Our empirical results indicate that several candidates perform competitively with current standards; notably, eight schemes outperform SLH-DSA in signing efficiency, with HAWK and CROSS approaching the performance levels of ML-DSA and FALCON. However, memory analysis reveals critical trade-offs. While HAWK and CROSS maintain high efficiency, multivariate schemes like UOV and FAEST incur significantly higher memory overheads. These observed performance characteristics provide a stronger basis for selecting suitable post-quantum signatures in practical PKI environments.

Silicon Valley Cybersecurity Conference (SVCC)•Jun 1, 2026•0 citations

Post-quantum cryptographic authentication protocol for industrial IoT using lattice-based cryptography

Abdul Basit Shahid, Khwaja Mansoor, Yawar Abbas Bangash +2 more

The integration of NIST-standardized lattice-based cryptographic algorithms (ML-KEM and ML-DSA) into TLS 1.3 enables post-quantum secure authentication for Industrial IoT (IIoT) environments. This work implements these algorithms within the X.509 certificate infrastructure and evaluates their performance on resource-constrained IIoT hardware (Raspberry Pi 4). Experimental measurements covering key generation, encapsulation, decapsulation, and signature operations were obtained using a liboqs-enabled TLS 1.3 stack. The results show that PQ TLS 1.3 achieves comparable handshake latency to conventional TLS on IIoT-class gateways, with certificate size identified as the dominant overhead. These findings confirm the practicality of post-quantum authentication in IIoT systems while acknowledging limitations related to the hardware scope and simulated networking. Future work will extend validation to field deployments and additional PQC candidates.

Scientific Reports•Mar 3, 2026•19 citations

A Lightweight Variant of Falcon for Efficient Post-Quantum Digital Signature

Aigerim Kerimbayeva, Maksim Iavich, Yenlik Begimbayeva +4 more

Conventional public-key cryptographic systems are increasingly threatened by advances in quantum computing, accelerating the need for robust post-quantum cryptographic solutions. Among these, Falcon, a compact lattice-based digital signature scheme, has emerged as a leading candidate in the NIST post-quantum standardization process due to its efficiency and theoretical security grounded in hard lattice problems. This work introduces Falcon-M, a modified version of the Falcon algorithm that significantly reduces implementation complexity. It does so by replacing Falcon’s intricate trapdoor-based key-generation mechanism with a simplified approach that utilizes randomized polynomial Gaussian sampling and fast Fourier transform (FFT) operations. Falcon-M incorporates SHA-512 hashing and discrete Gaussian sampling to preserve cryptographic soundness and statistical randomness while maintaining the core structure of Falcon’s signing and verification processes. We formally specify the Falcon-M algorithm, provide an updated pseudocode, and offer a comparative analysis with the original Falcon in terms of algorithmic complexity, security assumptions, and implementation overhead. Additionally, we present formal lemmas and theorems to ensure correctness and define theoretical bounds on forgery resistance. Although Falcon-M does not rely on a formal cryptographic trapdoor, we demonstrate that it achieves strong practical security based on assumptions related to the Short Integer Solution (SIS) problem. Falcon-M is thus well-suited for lightweight post-quantum applications, particularly in resource-constrained environments, such as embedded systems and Internet-of-Things (IoT) platforms.

Information•Jul 1, 2025•8 citations
This article provides an expanded computational evaluation of three standardized lattice-based post-quantum signature schemes—ML-DSA-44, ML-DSA-65 and Falcon-512—using reference implementations from the Open Quantum Safe (liboqs) project. Unlike prior benchmarking efforts that rely on optimized implementations or hardware-specific tuning, this work focuses on reproducible baseline performance on a conventional CPU platform. We measure key generation, signing and verification times across 5,000 iterations and analyze the effect of message length on signing cost. Results confirm that ML-DSA variants achieve significantly faster signing and key generation, whereas Falcon-512 produces substantially smaller keys and signatures. The study further highlights the computational dominance of lattice operations over hashing, explaining the weak dependence of signing cost on message size. These findings aim to support system architects evaluating the practical feasibility of standardized post-quantum signature algorithms.
This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.
The advent of large-scale, fault-tolerant quantum computers threatens the mathematical foundations - namely integer factorization and discrete-logarithm hardness - on which today's public-key cryptography relies could be rendered insecure. This has shifted the need to move to Post-Quantum Cryptography (PQC) from a theoretical to an engineering priority. This work presents an extensive empirical comparison of the NIST standardized primitives used for key encapsulation (FIPS 203: ML-KEM) and digital signatures (FIPS 204: ML-DSA) with the standardised classical RSA-3072 primitives at similar security levels as defined by the NIST security level. This paper evaluates three fundamental performance metrics: (i) computational latency in CPU clock cycles; (ii) communication cost in bytes; and (iii) memory usage during the cryptographic operation, and combines them into a unified evaluation framework. Additionally, the paper discusses the mathematical principles of the standardized quantum-resistant schemes, namely Module Short Integer Solution (MSIS) and Module Learning With Errors (MLWE) focusing on their security principles. Benchmarking reveals that, despite lattice-based schemes incurring larger public key and signature sizes-up to32×32 \times32×relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately108×108 \times108×faster than an RSA-3072 private-key operation, and ML-DSA-65 signing is approximately 19× faster than RSA-3072 signing. To support cryptographic agility during the post-quantum migration period, this paper proposes a modular hybrid architecture validated through a triple-hybrid (ECDH + Kyber + BB84 QKD) demonstration.
Large-scale quantum computers would invalidate the hardness assumptions behind many deployed public key cryptosystems and reduce the effective strength of symmetric primitives. As a result, governments and industry have begun a multi-year transition toward post quantum cryptography and quantum safe protocols. This survey provides a structured overview of that transition. It classifies the main families of post quantum schemes, with emphasis on the standardized lattice based and hash-based algorithms ML-KEM, ML-DSA, SLH-DSA, FALCON and Classic McEliece, and it summarizes their parameter sets, key sizes, ciphertext or signature lengths and performance profiles across the NIST security categories. The survey then reviews stateful hash-based signatures, multivariate and isogeny-based proposals and emerging MPC in the head constructions and discusses their security assumptions and level of maturity. At the protocol level it analyzes hybrid designs for TLS 1.3, QUIC, IPsec, SSH and public key infrastructures and draws lessons from early deployments in web, IoT, and cloud environments. By collating detailed parameter data from recent NIST standards and reference implementations and mapping them to concrete deployment scenarios, the survey links high-level policy guidance to engineering choices. The paper also synthesizes cross cutting implementation and migration challenges, including side channel resistance, cryptographic agility, asset inventory and migration planning, and algorithm diversity across deployments. Finally, it identifies open problems such as leakage resilient implementations, domain specific post quantum profiles for constrained devices and combinations of post quantum cryptography with quantum key distribution. The goal is to give researchers and practitioners a coherent reference that connects algorithms, standards, protocol mechanisms and deployment guidance for building quantum safe systems.
Recent advancements in quantum computing threaten the cryptographic foundations of Public Key Infrastructure (PKI). Although the National Institute of Standards and Technology (NIST) has standardized three post-quantum digital signature algorithms, namely ML-DSA, SLH-DSA, and FALCON, fourteen additional candidates are currently under evaluation, to diversify the collection of available post-quantum signature schemes. This work presents a comprehensive performance analysis of the fourteen ‘Round 2’ digital signature candidates within a functional X. 509 PKI environment. Unlike prior studies focused on isolated benchmarking, we evaluate the complete PKI life cycle, key generation, CSR creation, as well as certificate signing and verification. Our empirical results indicate that several candidates perform competitively with current standards; notably, eight schemes outperform SLH-DSA in signing efficiency, with HAWK and CROSS approaching the performance levels of ML-DSA and FALCON. However, memory analysis reveals critical trade-offs. While HAWK and CROSS maintain high efficiency, multivariate schemes like UOV and FAEST incur significantly higher memory overheads. These observed performance characteristics provide a stronger basis for selecting suitable post-quantum signatures in practical PKI environments.
The integration of NIST-standardized lattice-based cryptographic algorithms (ML-KEM and ML-DSA) into TLS 1.3 enables post-quantum secure authentication for Industrial IoT (IIoT) environments. This work implements these algorithms within the X.509 certificate infrastructure and evaluates their performance on resource-constrained IIoT hardware (Raspberry Pi 4). Experimental measurements covering key generation, encapsulation, decapsulation, and signature operations were obtained using a liboqs-enabled TLS 1.3 stack. The results show that PQ TLS 1.3 achieves comparable handshake latency to conventional TLS on IIoT-class gateways, with certificate size identified as the dominant overhead. These findings confirm the practicality of post-quantum authentication in IIoT systems while acknowledging limitations related to the hardware scope and simulated networking. Future work will extend validation to field deployments and additional PQC candidates.
Conventional public-key cryptographic systems are increasingly threatened by advances in quantum computing, accelerating the need for robust post-quantum cryptographic solutions. Among these, Falcon, a compact lattice-based digital signature scheme, has emerged as a leading candidate in the NIST post-quantum standardization process due to its efficiency and theoretical security grounded in hard lattice problems. This work introduces Falcon-M, a modified version of the Falcon algorithm that significantly reduces implementation complexity. It does so by replacing Falcon’s intricate trapdoor-based key-generation mechanism with a simplified approach that utilizes randomized polynomial Gaussian sampling and fast Fourier transform (FFT) operations. Falcon-M incorporates SHA-512 hashing and discrete Gaussian sampling to preserve cryptographic soundness and statistical randomness while maintaining the core structure of Falcon’s signing and verification processes. We formally specify the Falcon-M algorithm, provide an updated pseudocode, and offer a comparative analysis with the original Falcon in terms of algorithmic complexity, security assumptions, and implementation overhead. Additionally, we present formal lemmas and theorems to ensure correctness and define theoretical bounds on forgery resistance. Although Falcon-M does not rely on a formal cryptographic trapdoor, we demonstrate that it achieves strong practical security based on assumptions related to the Short Integer Solution (SIS) problem. Falcon-M is thus well-suited for lightweight post-quantum applications, particularly in resource-constrained environments, such as embedded systems and Internet-of-Things (IoT) platforms.