A public-key cryptographic algorithm whose security rests on the practical difficulty of factoring the product of two large prime numbers, used to encrypt data and to sign messages so their origin can be verified without ever sharing a secret key.
Facts
Origin YearAn equivalent system was developed secretly in 1973 at GCHQ by Clifford Cocks, but it was not declassified until 1997. Core PrincipleA public-key cryptosystem in which each user holds a private key, a pair of large secret prime numbers, and a public key, the product of those primes; security rests on the difficulty of factoring that product back into its prime factors. 1 Connections
Associated With
Verified en.wikipedia.org/wiki/Rabin_cryptosystem: "The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty of integer factorization."
In Field
Invented By
Source Wikipedia: Adi Shamir
Sources
1. Wikipedia: RSA cryptosystem
Wikimedia FoundationLead section, first paragraph
The initialism "RSA" comes from the last-names of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977.
Lead section, second paragraph
The security of RSA is related to the difficulty of factoring the product of two large prime numbers, the "factoring problem".
View the Source Wikipedia: Adi Shamir
Wikimedia FoundationInvented By: Adi Shamir, introductionQuote, Invented By: Adi Shamir, introduction
He is a co-inventor of the Rivest-Shamir-Adleman (RSA) algorithm (along with Ron Rivest and Len Adleman)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.