Introduction - If you have any usage issues, please Google them yourself
RSA public key encryption algorithm is 1977 by 罗纳德李维 Manchester (Ron Rivest), Adi Shamir (Adi Shamir) and Leonard de Derman (Leonard Adleman) raised together. At that time th ree of them are working at MIT. RSA is the last name beginning with the letter three of them together to form a fight. RSA is the most influential public-key encryption algorithm, which can resist the vast majority of password attacks known so far, has been recommended as a public-key data encryption ISO standard. Today, only a short RSA keys can be a powerful way to be cracked. By 2008, the world has no reliable way to attack the RSA algorithm. As long as the length of the key is sufficiently long, the RSA encryption information is actually the solution can not be broken. But in distributed computing and quantum computer theory matures today, RSA encryption security has been challenged. RSA algorithm is based on a very simple fact of number theory: multiplying two large prime numbers is very easy, but then wan