Prime Factorization in the Duality Computer

, , and

Published under licence by IOP Publishing Ltd
, , Citation Wang Wan-Ying et al 2007 Commun. Theor. Phys. 47 471 DOI 10.1088/0253-6102/47/3/019

Download Article PDF

Article metrics

126 Total downloads

Share this article

Author affiliations

1 Key Laboratory for Quantum Information and Measurements and Department of Physics, Tsinghua University, Beijing 100084, China

2 School of Computer Science & Technology, Beijing Institute of Technology, Beijing 100081, China

3 Key Laboratory of Atomic and Molecular Nanosciences, Tsinghua University, Beijing 100084, China

Dates

  1. Received 8 August 2006
Journal RSS
Sign up for new issue notifications
0253-6102/47/3/471

Abstract

We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms may be polynomial in the input size.

Export citation and abstract BibTeX RIS

Previous article in issue
Next article in issue
10.1088/0253-6102/47/3/019