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

References

• Fuchs, C.A. ; Peres, A. Quantum-state Disturbance versus Information Gain: Uncertainty Relations for Quantum Information. Phys. Rev. A 1996, 53 , 2038–2045.
   PubMed Web of Science ®Google Scholar
• Slutsky, B.A. ; Rao, R. ; Sun, P.-C. ; Fainman, Y. Security of Quantum Cryptography against Individual Attacks. Phys. Rev. A 1998, 57 , 2383–2398.
   Web of Science ®Google Scholar
• Brandt, H.E. Quantum-cryptographic Entangling Probe. Phys. Rev. A 2005, 71 , 042312.
   Web of Science ®Google Scholar
• Shapiro, J.H. ; Wong, F.N.C. Attacking Quantum Key Distribution with Single-photon Two-qubit Quantum Logic. Phys. Rev. A 2006, 73 , 012315.
   Web of Science ®Google Scholar
• Kim, T. ; Wersborg, I.S.g. ; Wong, F.N.C. ; Shapiro, J.H. Complete Physical Simulation of the Entangling-probe Attack on the Bennett--Brassard 1984 Protocol. Phys. Rev. A 2007, 75 , 042327.
   Web of Science ®Google Scholar
• Bennett, C.H. ; Brassard, G. Quantum Cryptography: Public Key Distribution and Coin Tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India; New York, IEEE, 1984; pp 175–179; Theor. Comput. Sci. 2014, 560(Part 1), 7--11.
   Google Scholar
• Bennett, C.H. Quantum Cryptography Using any Two Nonorthogonal States. Phys. Rev. Lett. 1992, 68 , 3121–3124.
   PubMed Web of Science ®Google Scholar
• Cirac, J.I. ; Gisin, N. Coherent Eavesdropping Strategies for the Four State Quantum Cryptography Protocol. Phys. Lett. A 1997, 229 , 1–7.
   Web of Science ®Google Scholar
• Hwang, W.Y. ; Ahn, D. ; Hwang, S.W. Eavesdropper’s Optimal Information in Variations of Bennett--Brassard 1984 Quantum Key Distribution in the Coherent Attacks. Phys. Lett. A 2001, 279 , 133–138.
   Web of Science ®Google Scholar
• Bruß, D. Optimal Eavesdropping in Quantum Cryptography with Six States. Phys. Rev. Lett. 1998, 81 , 3018–3021.
   Web of Science ®Google Scholar
• Massar, S. ; Popescu, S. Optimal Extraction of Information from Finite Quantum Ensembles. Phys. Rev. Lett. 1995, 74 , 1259–1263.
   PubMed Web of Science ®Google Scholar
• Shor, P.W. Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 1997, 26 , 1484–1509.
   Web of Science ®Google Scholar
• Ekert, A. ; Jozsa, R. Quantum Computation and Shor’s Factoring Algorithm. Rev. Mod. Phys. 1996, 68 , 733–753.
   Web of Science ®Google Scholar
• Simon, D.R. On the Power of Quantum Computation. SIAM J. Comput. 1997, 26 , 1474–1483.
   Web of Science ®Google Scholar
• Aharonov, D. Quantum Computation. In Annual Reviews of Computational Physics ; Stauffer, D. , Ed.; Vol. VI, Singapore, World Scientific Publishing, 1999; pp 259–346.
   Google Scholar
• Coppersmith, D. An Approximate Fourier Transform Useful in Quantum Factoring ; IBM Research Report No. RC19642 [arXiv:quant-ph/0201067]. 1994.
   Google Scholar
• Hardy, G.H. ; Wright, E.M. An Introduction to the Theory of Numbers , 4th ed.; Oxford University Press, London, 1975; Section 18.5.
   Google Scholar
• Bennett, C.H. ; Brassard, G. ; Crépeau, C. ; Jozsa, R. ; Peres, A. ; Wootters, W.K. Teleporting an Unknown Quantum State via Dual Classical and Einstein--Podolsky--Rosen Channels. Phys. Rev. Lett. 1993, 70 , 1895–1899.
   PubMed Web of Science ®Google Scholar