Papalocal
Loading…
Papalocal · Things
Work

RSA cryptosystem

RSA cryptosystem is an algorithm for public-key cryptography. It came out in 1977.

Released
1977
Came out
1977
All 5 facts, and where they come from

Facts

5 facts · 0 confirmed by two sources · 1 cited · 4 from one source

What it is
cryptosystem One source
Released
1977 One source
Came out
1977 Cited
Named after
Ron Rivest One source
Adi Shamir One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2526642906
Described as
algorithm for public-key cryptography
Other names
RSA (cryptosystem), Rivest–Shamir–Adleman
What it is
cryptosystem
Released
1977
Came out
1977 · 1 reference
Named after
Ron Rivest; Adi Shamir
Wikipedias with a page
55

Wikidata item Q181551 (wikidata.org/wiki/Q181551), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1379879111

The RSA (Rivest–Shamir–Adleman) cryptosystem is a family of public-key cryptosystems (one of the oldest), widely used for secure data transmission. The initialism "RSA" comes from the last-names of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly in 1973 at Government Communications Headquarters (GCHQ), the British signals intelligence agency, by the English mathematician Clifford Cocks. That system was declassified in 1997.
RSA is used in digital signature such as RSASSA-PSS or RSA-FDH,
public-key encryption of very short messages (almost always a single-use symmetric key in a hybrid cryptosystem) such as RSAES-OAEP,
and public-key key encapsulation.
In RSA-based cryptography, a user's private key—which can be used to sign messages, or decrypt messages sent to that user—is a pair of large prime numbers chosen at random and kept secret.
A user's public key—which can be used to verify messages from the user, or encrypt messages so that only that user can decrypt them—is the product of the prime numbers.
The security of RSA is related to the difficulty of factoring the product of two large prime numbers, the "factoring problem". Breaking RSA encryption is known as the RSA problem. Whether it is as difficult as the factoring problem is an open question. There are no published methods to defeat the system if a large enough key is used.

From the Wikipedia article “RSA cryptosystem” (en.wikipedia.org/wiki/RSA_cryptosystem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it