About 300 years ago, European Miltrie has composed "Elements". His 13 books have discussed the number theory, introducing the basic concepts of the score, the number and the number of composite. In 58 BC, Juliz Caesa conquered Gao Lu. His "Gaul" contains the cases of the use of the previous history of the newly recorded information. In 1586, a diploma in France has developed the first compound alphabetical order, which can be done different encryption in such an encrypted letter. In 1640, French mathematician Pierre de Fermat discovered the "Fermat Small Legal", although this rule was not impeccable, but until today, it was used to test a large number of prime numbers. In 1801, German mathematician Carl Friedrich Gauss published "Disquisitiones Arithmeticae, which is the foundation of modern digital theory. He is the first person in the ability to admire the model, which is also largely explained some parts of the Fermat theory. In 1940, the early work of some Poland mathematicians and solutions, British mathematician alan turning cracked the enigma password. The Allies of the Western European Battlefields decrypt the German military intelligence accelerated the victory of the Allies in the Second World War. In 1976, WHITFIELD DIFFIE, MARTIN HELLMAN and RALPH MERKLE promoted the development of encryption, and the key encrypted and decrypted key was already different. This unveiled the curtain of the public key plus ticking era. At this time they didn't know that the British intelligence James Ellis had used the same technology, but he had to keep secret. In 1977, Ronald Rivest, Adi Shamir and Leonard Adleman invented the RSA encryption algorithm, in which the security of a public key system in this algorithm relies on the difficulty of bulk decomposition. They disclose challenges to anyone who can solve the information encoded by 129 digits of them. In 1981, Carl Pomerat has developed a "secondary equation filter" method, which allows large digitally decomposed issues to package processing through multiple computers. In 1988, the "Digital Filtering" method was invented by John Pollaard. In 1994, the information published by Rivest, Shamir and Adleman in 1977 was cracked by a group of hundreds of computer scholars by using secondary equation filtration. In 1994, the Peter Shor of the AT & T Laboratory has developed a "rapid" (that is, multiple time) due to decomposition algorithm, this operation can work in a quantum computer. However, whether it can make such a computer is still an unknown. In 1999, a 155-bit RSA challenge figures were cracked by a group of researchers. They used the integrated digital field filtration method. In 2002, Manindra Agrawal, Neraj Kayal and Nitin Saxen developed a number of time testing algorithms that analyzed in a regular computer. This kind of operation is to rely on a genius for the Fermat small law.
