(public-key cryptography) Named after the mathematicians Ron Rivest, Adi Shamir, and Leonard Aldeman, a cryptographic algorithm which depends on the difficulty of factorizing large semiprimes and a commonly used form of encryption for Internet security.
The public key consists of natural numbers n and e, where n is a product of two distinct large primes p and q. As of 2020, most RSA keys have 21024