The Separation Algorithm of Dividing Large Integer into Two Prime Divisor Product
Sun Ke-quan · Journal of Tianjin Vocational Institutes · 2011
RSA calculation is based on two divisors product n and 1,which forms the conditional public key(e,n).The safety of RSA depends on the difficulty of dividing the large integer n.According to the characteristic of public key RSA and Euclid Calculations,this essay presents a decomposing n's calculation——Separation Algorithm,and undergoes mathematical proof,design and analysis.At the same time,during the design of module n,it proves unsafe if the integer multiple is too close to n(1/2).