Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains

• URL: http://arxiv.org/abs/2510.09271v1
• Date: Fri, 10 Oct 2025 11:12:53 GMT
• Title: Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains
• Authors: Alison Gonçalves Schemitt, Henrique Fan da Silva, Roben Castagna Lunardi, Diego Kreutz, Rodrigo Brandão Mansilha, Avelino Francisco Zorzo,
• Abstract summary: Post-quantum cryptography (PQC) is an important step in the transition to quantum-resistant security.<n>Traditional cryptographic algorithms are vulnerable to quantum attacks.<n>PQC is essential for long-term security, but its computational overhead in blockchain environments remains largely unexplored.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The advent of quantum computing threatens the security of traditional encryption algorithms, motivating the development of post-quantum cryptography (PQC). In 2024, the National Institute of Standards and Technology (NIST) standardized several PQC algorithms, marking an important milestone in the transition toward quantum-resistant security. Blockchain systems fundamentally rely on cryptographic primitives to guarantee data integrity and transaction authenticity. However, widely used algorithms such as ECDSA, employed in Bitcoin, Ethereum, and other networks, are vulnerable to quantum attacks. Although adopting PQC is essential for long-term security, its computational overhead in blockchain environments remains largely unexplored. In this work, we propose a methodology for benchmarking both PQC and traditional cryptographic algorithms in blockchain contexts. We measure signature generation and verification times across diverse computational environments and simulate their impact at scale. Our evaluation focuses on PQC digital signature schemes (ML-DSA, Dilithium, Falcon, Mayo, SLH-DSA, SPHINCS+, and Cross) across security levels 1 to 5, comparing them to ECDSA, the current standard in Bitcoin and Ethereum. Our results indicate that PQC algorithms introduce only minor performance overhead at security level 1, while in some scenarios they significantly outperform ECDSA at higher security levels. For instance, ML-DSA achieves a verification time of 0.14 ms on an ARM-based laptop at level 5, compared to 0.88 ms for ECDSA. We also provide an open-source implementation to ensure reproducibility and encourage further research.

Related papers

• Performance Analysis of Quantum-Secure Digital Signature Algorithms in Blockchain [0.0]
  This report presents a blockchain prototype that supports multiple quantum-secure signature algorithms.<n>It focuses on CRYSTALS-Dilithium, Falcon and Hawk as lattice-based schemes.<n>It also provides a detailed comparison of quantum-secure signatures in a blockchain context and extending the analysis to schemes such as HAETAE.
  arXiv  Detail & Related papers  (2026-01-25T10:52:47Z)
• Quantum Disruption: An SOK of How Post-Quantum Attackers Reshape Blockchain Security and Performance [6.516258691106587]
  We examine the implications of adopting post-quantum cryptography in blockchain systems across four key dimensions.<n>We identify the cryptographic primitives within blockchain architectures that are most vulnerable to quantum attacks.<n>We evaluate how replacing classical primitives with post-quantum alternatives affects system performance, protocol dynamics, and the incentive and trust structures that sustain blockchain ecosystems.
  arXiv  Detail & Related papers  (2025-12-15T13:48:14Z)
• Literature Review of the Effect of Quantum Computing on Cryptocurrencies using Blockchain Technology [0.0]
  This paper presents a literature review evaluating how quantum algorithms, specifically Shors and Grovers, could disrupt the foundational security mechanisms of cryptocurrencies.<n>This review identifies specific vulnerabilities in transaction and consensus processes in Bitcoin, Litecoin, Monero, and Zcash.<n>In anticipation, it investigates countermeasures including Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD), and protocol-level modifications such as memory-intensive proof-of-work algorithms and multi-signature schemes.
  arXiv  Detail & Related papers  (2025-08-24T10:53:41Z)
• Performance and Storage Analysis of CRYSTALS Kyber as a Post Quantum Replacement for RSA and ECC [45.88028371034407]
  CRYSTALS-Kyber is a post-quantum cryptographic solution standardized by NIST in 2022.<n>This study evaluates Kyber's practical viability through performance testing across various implementation schemes.
  arXiv  Detail & Related papers  (2025-08-03T09:53:45Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• PQS-BFL: A Post-Quantum Secure Blockchain-based Federated Learning Framework [0.0]
  Federated Learning (FL) enables collaborative model training while preserving data privacy, but its classical cryptographic underpinnings are vulnerable to quantum attacks.<n>This paper introduces PQS-BFL, a framework integrating post-quantum cryptography with blockchain verification to secure FL against quantum adversaries.
  arXiv  Detail & Related papers  (2025-05-03T17:11:03Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• The Security Performance Analysis of Blockchain System Based on Post-Quantum Cryptography -- A Case Study of Cryptocurrency Exchanges [0.0]
  The study proposes a post-quantum cryptography (PQC)-based blockchain system to enhance security by addressing and improving each identified weakness. The efficiency of the Dilithium algorithm, a PQC digital signature algorithm, in producing wallets, generating signatures, and verifying signatures surpasses that of ECDSA in the current blockchain system.
  arXiv  Detail & Related papers  (2024-01-23T05:21:58Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.