Metraipolis › archive › dc_d96de71d1bb7

RSA cryptosystem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/RSA_cryptosystem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:20:22.321Z
SHA-256 of the archived text
7750ad6339aa0965214aa3500ac62354d30806f75918bc3908cb52de665295ae
Stable URL of this page
https://metraipolis.com/documento/dc_d96de71d1bb7

How to cite

RSA cryptosystem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/RSA_cryptosystem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d96de71d1bb7 (Metraipolis archive dc_d96de71d1bb7, sha256 7750ad6339aa0965214aa3500ac62354d30806f75918bc3908cb52de665295ae)
BibTeX
@misc{dcd96de71d1bb7,
  title = {RSA cryptosystem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/RSA_cryptosystem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d96de71d1bb7; sha256 7750ad6339aa0965214aa3500ac62354d30806f75918bc3908cb52de665295ae},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/RSA_cryptosystem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «digital signature»).
Fonte: Wikipedia in inglese, voce «RSA cryptosystem» — https://en.wikipedia.org/wiki/RSA_cryptosystem
Wikidata Q181551 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q181551
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/RSA_cryptosystem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377837582, consultata il 2026-10-05T23:05:42.512Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 453b8845b9a14eec6902eacd8daee86377395c4a9a376fe7d3b78a60d9066f0a