Performance Analysis of Quantum-Secure Digital Signature Algorithms in Blockchain

• URL: http://arxiv.org/abs/2601.17785v1
• Date: Sun, 25 Jan 2026 10:52:47 GMT
• Title: Performance Analysis of Quantum-Secure Digital Signature Algorithms in Blockchain
• Authors: Tushar Jain,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The long-term security of public blockchains strictly depends on the hardness assumptions of the underlying digital signature schemes. In the current scenario, most deployed cryptocurrencies and blockchain platforms rely on elliptic-curve cryptography, which is vulnerable to quantum attacks due to Shor's algorithm. Therefore, it is important to understand how post-quantum (PQ) digital signatures behave when integrated into real blockchain systems. This report presents a blockchain prototype that supports multiple quantum-secure signature algorithms, focusing on CRYSTALS-Dilithium, Falcon and Hawk as lattice-based schemes. This report also describes the design of the prototype and discusses the performance metrics, which include key generation, signing, verification times, key sizes and signature sizes. This report covers the problem, background, and experimental methodology, also providing a detailed comparison of quantum-secure signatures in a blockchain context and extending the analysis to schemes such as HAETAE.

Related papers

• 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)
• Post-Quantum Blockchain: Challenges and Opportunities [0.0]
  Post-Quantum Computation (PQC) is a basic solution for resisting these quantum attacks.<n>This paper aims to review the threats imposed by quantum computers on classical blockchain technology.<n>It provides useful guidelines on PQB security to blockchain researchers.
  arXiv  Detail & Related papers  (2025-08-23T15:53:49Z)
• 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)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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)
• Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks [0.0]
  This article studies current state of the art on post-quantum cryptosystems and how they can be applied to blockchains and DLTs. It provides comparisons on the characteristics and performance of the most promising post-quantum public-key encryption and digital signature schemes for blockchains.
  arXiv  Detail & Related papers  (2024-02-01T17:29:07Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• 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)
• 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.