RSA公钥加密算法是1977年由罗纳德·李维斯特（Ron Rivest）、阿迪·萨莫尔（Adi Shamir）和伦纳德·阿德曼（Leonard Adleman）一起提出的。当时他们三人都在麻省理工学院工作。RSA就是他们三人姓氏开头字母拼在一起组成的。



RSA是目前最有影响力的公钥加密算法，它能够抵抗到目前为止已知的绝大多数密码攻击，已被ISO推荐为公钥数据加密标准。



今天只有短的RSA钥匙才可能被强力方式解破。到2008年为止，世界上还没有任何可靠的攻击RSA算法的方式。只要其钥匙的长度足够长，用RSA加密的信息实际上是不能被解破的。但在分布式计算和量子计算机理论日趋成熟的今天，RSA加密安全性受到了挑战。



RSA算法基于一个十分简单的数论事实：将两个大素数相乘十分容易，但那时想要对其乘积进行因式分解却极其困难，因此可以将乘积公开作为加密密钥。-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 the three 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