Recently, Shandong University has a crack team to find a simple method of rapid apolymexin factor, which can be used for the decryption of RSA. We know that the security of the use of extensive encryption algorithms RSA is based on the decomposition of the majority. If the efficient algorithm RSA to find a large number of algorithm decomposition will have no force. In fact, when the Indian Institute of Technology, Marydera, Agrava discovered a simple diameter judgment method, many mathematics workers worried that there may be a simple solution that may ignore a lot of major mathematical problems, there may be a simple suspended factor decomposition algorithm, only But we haven't found it yet. The Jikai and his cracked team member Liu Qiang, a member of the School of Information Science and Engineering, Shandong University, announced that such a fast factor decomposition algorithm was found and an algorithm was published. Below is a brief introduction of their announcement (I have been slightly sorted, some proven, these provers are very easy to date, if you are interested in this algorithm, I suggest you read slowly, I don't dare. Say other but it is very found to be affirmation !!): A large number N (n = pq p, Q is a large number), if you can find another M (M
