Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 68 of the 71 references it cites were found in a registry or an index; 23 of the 64 sources its claims cite were checked for support.

Quantum-resistance in blockchain networks

Open access
Allende, Marcos, León, Diego López, Cerón, Sergio, Pareja, Adrián, Pacheco, Erick, Leal, Antonio, Da Silva, Marcelo, Pardo, Alejandro, Jones, Duncan, Worrall, David J., Merriman, Ben, Gilmore, Jonathan, Kitchener, Nick, Venegas-Andraca, Salvador E. · 2023 · Scientific Reports

Abstract

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies and other digital assets that rely on blockchain ledgers as well as thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in these public and immutable ledgers. The quantum threat and some potential solutions are well understood and presented in the literature. However, most proposals are theoretical, require large QKD networks, or propose new quantum-resistant blockchain networks to be built from scratch. Our work, which is presented in this paper, is pioneer in proposing an end-to-end framework for post-quantum blockchain networks that can be applied to existing blockchain to achieve quantum-resistance. We have developed an open-source implementation in an Ethereum-based (i.e., EVM compatible) network that can be extended to other existing blockchains. For the implementation we have (i) used quantum entropy to generate post-quantum key pairs, (ii) established post-quantum TLS connections and X.509 certificates to secure the exchange of information between blockchain nodes over the internet without needing a large QKD network, (iii) introduced a post-quantum second signature in transactions using Falcon-512 post-quantum keys, and (iv) developed the first on-chain verification of post-quantum signatures using three different mechanisms that are compared and analyzed: Solidity smart-contracts run by the validators for each transaction, modified EVM Opcode, and precompiled smart contracts.

Overview

CoChat Summary

## TL;DR

The paper proposes and implements an end-to-end framework for making existing blockchain networks quantum-resistant by combining quantum entropy, post-quantum TLS/X.509, post-quantum transaction signatures, and on-chain verification. In an EVM-compatible LACChain pilot, the authors report that their preferred verification approach adds about 22 bytes per packet, increases memory from about 150 MB to about 200 MB, and raises CPU use by 10% to 30%.

## Key findings

  • The paper identifies two critical quantum-risk areas for blockchains: node-to-node communication and transaction signatures.
  • It implements a 5-step framework in LACChain: quantum entropy, post-quantum certificates, post-quantum TLS tunnels, post-quantum transaction signatures, and on-chain verification.
  • For communication overhead, the post-quantum channel adds a constant 22 bytes per packet.
  • For the preferred verification approach, node memory rises from around 150 MB to around 200 MB, and CPU overhead is reported as 10% to 30%.

## Methods

  • Design: A 5-step end-to-end post-quantum framework for blockchain networks, implemented on an EVM-compatible LACChain/Hyperledger Besu network.
  • Data/sample: A pilot deployment on LACChain nodes, using Quantum Origin as the entropy source and Falcon-512 for post-quantum signatures; tests were run in Google Cloud on a virtual environment with 2 vCPUs and 7.5 GB memory.
  • Analysis: The authors compare three on-chain verification mechanisms for Falcon signatures—Solidity smart contract, modified EVM opcode, and precompiled smart contract—and measure packet overhead, Java memory, and CPU consumption under classical vs post-quantum configurations.

## Limitations

  • The paper states that QKD is “not scalable today” and therefore was not used as the solution; instead it relies on post-quantum cryptography and a central entropy source for the pilot.
  • The Solidity on-chain verification approach is described as impractical because it needs about 500 million gas per Falcon signature verification and exceeds the 24 kb code-size limit; this is a limitation stated in the paper.
  • Evident from the text: the implementation was tested in LACChain, so the reported performance and feasibility results are specific to that network and may not directly generalize to non-EVM blockchains.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41598-023-32701-6

Cites

68 of 69 references verified0 citation errors · 1 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 High-level schema of the first connection between the remote source of entropy and the blockchain node.
Figure 1 High-level schema of the first connection between the remote source of entropy and the blockchain node.CC BY · PubMed Central
Figure 2 Detailed flows describing the generation and consumption of entropy on demand by the Open SSL.
Figure 2 Detailed flows describing the generation and consumption of entropy on demand by the Open SSL.CC BY · PubMed Central
Figure 3 Comparison between Falcon and crystals-dilithium algorithms.
Figure 3 Comparison between Falcon and crystals-dilithium algorithms.CC BY · PubMed Central
Figure 4 High level diagram of the post-quantum certification and on-chain registration of an entity.
Figure 4 High level diagram of the post-quantum certification and on-chain registration of an entity.CC BY · PubMed Central
Figure 5 High level diagram of the post-quantum certification and on-chain registration of an entity.
Figure 5 High level diagram of the post-quantum certification and on-chain registration of an entity.CC BY · PubMed Central
Figure 6 Bytes per package.
Figure 6 Bytes per package.CC BY · PubMed Central
Figure 7 High level diagram presenting the different components from the DApp (it can also be an app or any application connected to the writer node and generating transactions) and the smart contract that it is calling.
Figure 7 High level diagram presenting the different components from the DApp (it can also be an app or any application connected to the writer node and generating transactions) and the smart contract that it is calling.CC BY · PubMed Central
Figure 8 High level diagram illustrating the flows from the generation of a transaction to the incorporation of that transaction to the transaction pool of a node, after validating the post-quantum signature.
Figure 8 High level diagram illustrating the flows from the generation of a transaction to the incorporation of that transaction to the transaction pool of a node, after validating the post-quantum signature.CC BY · PubMed Central
Figure 9 High level function hierarchy of Falcon highlighting the necessary calls for verification.
Figure 9 High level function hierarchy of Falcon highlighting the necessary calls for verification.CC BY · PubMed Central
Figure 10 Gas consumption by the on-chain verification of Falcon-512 using the Solidity smart contract.
Figure 10 Gas consumption by the on-chain verification of Falcon-512 using the Solidity smart contract.CC BY · PubMed Central
Figure 11 EVM virtual machine-based signature validation support.
Figure 11 EVM virtual machine-based signature validation support.CC BY · PubMed Central
Figure 12 Pros and Cons of Pure Solidity, EVM Opcode, and Precompiled contract.
Figure 12 Pros and Cons of Pure Solidity, EVM Opcode, and Precompiled contract.CC BY · PubMed Central
Figure 13 Comparison between the use of memory in the classical and post-quantum scenarios when sending 5 tx/s.
Figure 13 Comparison between the use of memory in the classical and post-quantum scenarios when sending 5 tx/s.CC BY · PubMed Central
Figure 14 Comparison between the average use of memory in the classical and post-quantum scenarios when sending 3, 5, and 10 tx/s.
Figure 14 Comparison between the average use of memory in the classical and post-quantum scenarios when sending 3, 5, and 10 tx/s.CC BY · PubMed Central
Figure 15 Comparison between the use of CPU in the classical and post-quantum scenarios when sending 5 tx/s.
Figure 15 Comparison between the use of CPU in the classical and post-quantum scenarios when sending 5 tx/s.CC BY · PubMed Central
Figure 16 Comparison between the average use of CPU in the classical and post-quantum scenarios when sending 3, 5, and 10 tx/s.
Figure 16 Comparison between the average use of CPU in the classical and post-quantum scenarios when sending 3, 5, and 10 tx/s.CC BY · PubMed Central

Verification

Claims the paper makes

17 Valid · 9 Not valid · 21 Not checked · 63 Own results and interpretations

38 more claims · 2 with their cited sources checked

Create a free account to see all 110 claims and to verify the 1 reference still open.

See all claims — free account
  • Probably not a substantial claim. 46
  • It may state two separate claims as one. 35
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 71 references

Research works printed but not linked: 7

  1. Feynman, R. P. Feynman Lectures on Computation (Penguin Books, 2009).
  2. Kitaev, A.Y., Shen, A.H. & Vyhalyi, M.N. Classical and quantum computation. in Graduate Studies in Mathematics. Vol. 47. (American Mathematical Society, 1999).
  3. Nigel, P. Smart, Cryptography Made Simple (Springer, 2016).
  4. Punathumkandi, S. & Boscovic, D. A survey on quantum-safe blockchain system. in Annual Computer Security Applications Conference, Austin TX USA (2022).
  5. Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R. & Smith-Tone, D. Report on Post-Quantum Cryptography-NISTIR 8105. https://nvlpubs.nist.gov/nistpubs/ir/2016/NIST.IR.8105.pdf. Accessed 15 Mar 2021 (NIST, 2016). · DOI · Paper page
  6. Khalid, Z. M. & Askar, S. Resistant blockchain cryptography to quantum computing attacks. Int. J. Sci. Bus. 5(3), 116–125 (2021).
  7. Kwiatkowski, K., Sullivan, N., Langley, A., Levin, D. & Mislove, A. Measuring TLS key exchange with post-quantum KEM in Workshop Record of the Second PQC Standardization Conference. https://csrc.nist.gov/CSRC/media/Events/Second-PQC-Standardization-Conference/documents/accepted-papers/kwiatkowski-measuring-tls.pdf. Accessed 07 Mar 2023 (2023).

Cited by

See all 109

Metadata

Authors
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., Merriman, B., Gilmore, J., Kitchener, N., & Venegas-Andraca, S. E.
Affiliations
  • Inter-American Development Bank (US)
  • Quantinuum (United Kingdom)
  • Tecnológico de Monterrey (MX)
Corresponding author
Venegas-Andraca, Salvador E.
Venue
Scientific Reports
Published
2023-04-06
Volume
13
Issue
1
Pages
5664-5664
ISSN
2045-2322 (ISSN-L)
OpenAlex
W4362661849
Cited by
109
References
71
Citations by year
2026: 21 · 2025: 44 · 2024: 33 · 2023: 8
FWCI
13.96
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
Inter-American Development Bank
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum resistance, post-quantum cryptography, X.509 certificates, Solidity smart contracts, Ethereum, Shor's algorithm, Grover's algorithm, proof-of-work

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum-resistance in blockchain networks. https://app.cochat.ai/papers/10.1038/s41598-023-32701-6
The paper
Allende, M., León, D. L., Cerón, S., Pareja, A., Pacheco, E., Leal, A., Da Silva, M., Pardo, A., Jones, D., Worrall, D. J., Merriman, B., Gilmore, J., Kitchener, N., & Venegas-Andraca, S. E. (2023). Quantum-resistance in blockchain networks. Scientific Reports. https://doi.org/10.1038/s41598-023-32701-6

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.