Paper: arXiv 2407.18966

Authors: Tatsuru Kikuchi

Abstract

Recently, the invention of quantum computers was so revolutionary that they bring transformative challenges in a variety of fields, especially for the traditional cryptographic blockchain, and it may become a real thread for most of the cryptocurrencies in the market. That is, it becomes inevitable to consider to implement a post-quantum cryptography, which is also referred to as quantum-resistant cryptography, for attaining quantum resistance in blockchains.

Complexity vs Empirical Score

  • Math Complexity: 9.0/10
  • Empirical Rigor: 0.5/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper is highly theoretical, filled with formal definitions, theorems, and proofs in cryptographic and quantum information theory, with no mention of backtests, datasets, or implementation code.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Review Post-Quantum Cryptography<br>for Blockchain Quantum Resistance"] --> B["Methodology:<br>Literature Review of Theoretical<br>Cryptography & Quantum Info Theory"]
  B --> C["Inputs:<br>Analysis of Quantum Threats<br>vs. Classical Cryptography"]
  C --> D["Computational Process:<br>Comparative Analysis of<br>Post-Quantum Candidates"]
  D --> E["Key Finding 1:<br>Quantum computers pose a<br>significant threat to current blockchain security"]
  D --> F["Key Finding 2:<br>Post-Quantum Cryptography is essential<br>for future-proofing cryptocurrencies"]
  E --> G["Outcome:<br>Foundational Framework for<br>Post-Quantum Blockchain Implementation"]
  F --> G

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes implementing post‑quantum (quantum‑resistant) cryptography in blockchain systems to achieve quantum resistance.

Source sentence
That is, it becomes inevitable to consider to implement a post-quantum cryptography, which is also referred to as quantum-resistant cryptography, for attaining quantum resistance in blockchains.

Assumes 2

  • RSA assumption holds: for all adversaries A, RSAadv(A, ℓ, e) is negligible. model
    Source sentence
    For given ℓ> 2 (integer) and e > 2 (odd integer), we call that the RSA assumption holds if for all A, RSAadv(A, ℓ, e) is negligible.
  • Decisional Diffie‑Hellman (DDH) assumption holds for the cyclic group Cp−1: for all efficient adversaries A, DDHadv(A, Cp−1) is negligible. model
    Source sentence
    We say that decisional Diffie-Hellman (DDH) assumption holds for Cp−1 if for all efficient adversaries A the value of DDHadv(A, Cp−1) is negligible.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds

No quantified findings extracted.

Checked by others

No other paper in the archive has been found to support or contradict these findings. Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.