  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 are polynomial in the input
size.
