| RSA algorithm
RSA algorithm
The RSA algorithm was created in August 1977 by Ronald Rivest, Adi Shamir, and Leonard Adleman, but supported documents from the British Government Communication Headquarters (GCHQ) show that the method was first invented in 1973 by Clifford Cocks. Then Adleman, Rivest, and Shamir saw its commercialization. They patented the method and formed RSA Data Security Inc.
Since then the RSA Laboratories was responsible for sponsoring the RSA Factoring Challenge to advance the science of large-number factorization and computational number theory. Currently, there are most likely still eight challenge numbers. The first is RSA-576 factored by J. Franke et al and received $10K. The second is RSA-640 for $20K and the last is RSA-2048 for $200K as the following number is to be prime factored:
25195908475657893494027183240048398571429282126204 03202777713783604
36620207075955562640185258807844069182906412495150 82189298559149176
18450280848912007284499268739280728777673597141834 72702618963750149
71824691165077613379859095700097330459748808428401 79742910064245869
18171951187461215151726546322822168699875491824224 33637259085141865
46204357679842338718477444792073993423658482382428 11981638150106748
10451660377306056201619676256133844143603833904414 95263443219011465
75444541784240209246165157233507787077498171257724 67962926386356373
28991215483143816789988504044536402352738195137863 65643912120103971
22822120720357
__________________
Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c²
| 
Linear Mode
