History Of Rsa Algorithm Used By Computer Science And Mathematics

1460 Words Sep 21st, 2016 6 Pages
History of RSA:
The RSA algorithm is a security method used by many companies and internet users today that protects fragile data when it is being sent from one computer to another and has the potential to be stolen. Cryptography itself has roots in battlefield messengers carrying plans or information that is critical to the success of his own side. RSA however uses a different approach, using an asymmetric key cryptosystem where messages can be sent mutually without any prior contact or shared knowledge. RSA cryptology uses modular exponentiation of prime numbers in order to encrypt data using basic prime patterns. The RSA method is an algorithm used by most computers today to encrypt and decrypt potentially vulnerable data that is sent over the internet. This encryption scheme relies on one of the most sought after problems in computer science and mathematics: P≟NP? For the RSA algorithm, the answer is no—for now.
P≠NP means that a problem that is easily checked by a computer is not necessarily easily solved by a computer. This is often called a one-way function, a term coined by Whitfield Diffie and Martin E. Hellman in their paper laying out the necessities for a new type of cryptography for the digital age . The Clay Mathematics Institute includes the P vs NP problem as one of their Millennium Problems and will give one million dollars to anyone who can solve it. In RSA, which was modeled and highly influenced by the Diffie-Hellman paper, this means that it…

Related Documents