English

An entangling-probe attack on Shor's algorithm for factorization

Quantum Physics 2017-12-25 v5

Abstract

We investigate how to attack Shor's quantum algorithm for factorization with an entangling probe. We show that an attacker can steal an exact solution of Shor's algorithm outside an institute where the quantum computer is installed if he replaces its initialized quantum register with entangled qubits, namely the entangling probe. He can apply arbitrary local operations to his own probe. Moreover, we assume that there is an unauthorized person who helps the attacker to commit a crime inside the institute. He tells garbage data obtained from measurements of the quantum register to the attacker secretly behind a legitimate user's back. If the attacker succeeds in cracking Shor's algorithm, the legitimate user obtains a random answer and does not notice the attacker's illegal acts. We discuss how to detect the attacker. Finally we estimate a probability that the quantum algorithm inevitably makes an error, of which the attacker can take advantage.

Cite

@article{arxiv.1705.00271,
  title  = {An entangling-probe attack on Shor's algorithm for factorization},
  author = {Hiroo Azuma},
  journal= {arXiv preprint arXiv:1705.00271},
  year   = {2017}
}

Comments

v1: 11 pages, latex2e; v2: 14 pages, 2 eps figures, the previous version has been completely rewritten with a new title; v3: minor corrections; v4: minor corrections; v5: a typographical error is corrected

R2 v1 2026-06-22T19:32:05.245Z