Biginteger Factoring In Distributed Enviorment

Big integer Factoring problem had been studied for centuries. With the development of Information Technology, RSA has been widely used in the past decades whose security is based on the hardness of factoring. That is: it is easy to find two large prime and get their product, but the knowledge of the product could not yield the two primes.Nowadays numbers can be factored more quickly and larger number could be factored, with the help of hardware improvement and development of factoring algorithms. Therefore in the past decade, the security length of RSA was raised from 512bit to 1024bit. For permanent use, 2048bit is recommended. Improvement in distributed computing is another power for factoring. Dr. Ian Foster gave the notation of grid computing in 1990s. And it is the state of art of the distributed computing.This paper addresses itself to the factoring algorithms and grid computing technology, especially on Multiple Polynomial Quadratic Sieve (MPQS). It also discusses problems encounter in implementation of MQPS, such as small multiplier, factoring parameters, polynomial generation, etc. After carefully study on different distributed QS implementation, it provides its own solution and implementation based on the characters of grid computing and MPQS.It could be find out from the result that the sieving stage of MPQS has good parallel properties. Distributed computing techniques, as a great tool for crypto analytics, also make challenge on crypto designers. Man should improve the security of crypto algorithms using nowadays.