Abstract:Due to the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factorization problem, the algorithms forfinding the prime factors of large composite numbers are becoming extremely important. In recent years the limits of the best integerfactorization algorithms have been extended greatly, due in part to Moore's law and in part to algorithmic improvements. Furthermore, new silicon devices, such as FPGAs, give us the advantage of custom hardware architectures for m… Show more