RSA algorithm

RSA algorithm
Name	RSA algorithm
Authors	Ron Rivest, Adi Shamir, Leonard Adleman
Introduced	1977
Type	Public-key cryptosystem
Based on	Integer factorization problem

RSA algorithm The RSA algorithm is a public-key cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman that enables secure data confidentiality and digital signatures. It relies on number-theoretic constructions related to prime numbers and modular arithmetic, and it plays a central role in modern protocols developed by organizations such as Internet Engineering Task Force, National Institute of Standards and Technology, and commercial products from Microsoft Corporation and Mozilla Foundation. RSA underlies standards and implementations deployed in systems used by Amazon (company), Google LLC, and financial institutions like JPMorgan Chase.

History

The conceptual basis for RSA emerged after the publication of public-key ideas at the Asiacrypt meetings and the earlier work by Whitfield Diffie and Martin Hellman on key exchange, inspiring research at institutions including the Massachusetts Institute of Technology and Stanford University. The 1977 paper by Rivest, Shamir, and Adleman followed contemporaneous contributions at places such as Bell Labs and led to patent activity involving the United States Patent and Trademark Office. RSA influenced the development of protocols standardized by the IETF and informed debates in the United States Congress and among companies such as Rivest, Shamir and Adleman (the initial inventors' association) over export controls and cryptographic policy during the 1990s, intersecting with events like the Clipper chip controversy.

Mathematical foundations

RSA rests on properties of integers studied since the work of Carl Friedrich Gauss and later results by Leonhard Euler and Srinivasa Ramanujan concerning primes and multiplicative functions. Its security is tied to the hardness of the integer factorization problem for semiprimes and uses Euler's totient function, which traces to Leonhard Euler's work, and modular exponentiation related to results in Pierre de Fermat's and Euler's theorems. Cryptanalytic advances by researchers at institutions such as CWI and groups like the RSA Laboratories have produced algorithms including the general number field sieve and earlier methods like the quadratic sieve. Complexity-theoretic classifications by scholars at MIT and Berkeley place factoring in contexts alongside classes studied by theoreticians influenced by Alan Turing and Alonzo Church.

Key generation

Key generation begins by selecting two large distinct primes, a procedure influenced by primality tests developed at institutions such as Princeton University and companies like Intel Corporation. Modern implementations use probabilistic tests such as the Miller–Rabin primality test and deterministic results refined by work from Carl Pomerance and others at universities including Dartmouth College. After choosing primes p and q, the modulus n = p·q is formed and an exponent e is selected typically co-prime to Euler's totient φ(n); computing the multiplicative inverse d uses the extended Euclidean algorithm whose roots trace to work in Ancient Greece and formalization at universities like Oxford University. Key lengths recommended by NIST and debated by researchers at European Telecommunications Standards Institute have increased over time following advances in factorization by groups associated with CWI and research labs at IBM.

Encryption and decryption

Encryption and decryption in RSA use modular exponentiation, a primitive efficient by exponentiation by squaring techniques taught at institutions such as Harvard University and used in cryptographic libraries from organizations like OpenSSL and LibreSSL. A plaintext m is raised to the public exponent e modulo n to produce ciphertext c, and decryption applies exponent d to recover m; optimizations include the Chinese remainder theorem (CRT), itself a classical result with historical links to Chinese mathematics and modern exposition at universities such as Cambridge University. Implementations often combine RSA with symmetric algorithms standardized by IETF working groups and bodies like NIST to provide hybrid encryption in protocols such as Transport Layer Security.

Security and attacks

Security analyses of RSA consider factoring attacks via the general number field sieve developed by researchers at groups including CWI and universities such as University of Bonn, and side-channel attacks demonstrated by teams at Karlsruhe Institute of Technology and commercial security firms like Rivest, Shamir and Adleman's labs. Practical exploits have used padding oracle attacks that reference standards like PKCS #1 from the RSA Security consortium and protocol-level weaknesses found in implementations by vendors such as Apple Inc. and Cisco Systems. Post-quantum concerns stem from algorithms proposed by Peter Shor at AT&T Bell Laboratories, motivating alternative schemes surveyed by NIST and research programs at Google Research.

Implementations and performance

RSA is implemented in widely used libraries such as OpenSSL, Bouncy Castle (software) and platform frameworks maintained by Microsoft Corporation and Apple Inc.. Hardware acceleration appears in processors from Intel Corporation and ARM Limited and in dedicated modules like Trusted Platform Module and Hardware Security Module. Performance considerations led to variants (CRT, multi-prime RSA) and optimizations informed by work at institutions such as Stanford University and companies including RSA Security LLC; benchmarking and interoperability testing occur in events organized by bodies like the IETF and consortia including the Internet Society.

Applications and standards

RSA is specified and used in standards such as PKCS #1, incorporated into protocol suites like TLS and SSL, and employed in secure email standards standardized by IETF working groups for S/MIME. It underpins authentication systems used by companies like VeriSign (now part of Symantec), secure shell implementations in projects such as OpenSSH, and digital signature schemes adopted in legal and commercial contexts governed by institutions like European Commission and ITU. Contemporary deployments coexist with alternative public-key schemes featured in competitions organized by NIST for post-quantum cryptography.

Category:Cryptography