摘要
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.
基金
The project supported by the 973 Program under Grant No. 2006CB921106, National Natural Science Foundation of China under Grant Nos. 10325521 and 60433050, and the Key Project 306020 and Science Research Fund of Doctoval Program of the Ministry of Education of China
