How RSA Public-Key Encryption Keeps Digital Messages Secret

This patent describes the foundational RSA algorithm, a method for securely sending messages where anyone can encrypt a message using a public key, but only the intended recipient can decrypt it using a secret private key.

What it covers

This patent outlines a cryptographic system for secure communication. A sender transforms a message, represented as a number M, into a secret ciphertext C. This is done by calculating M raised to a specific power 'e' and then finding the remainder when that result is divided by a large composite number 'n' (C ≡ M^e (mod n)), as described in Claim 1. The numbers 'e' and 'n' form the public key. The intended receiver then takes this ciphertext C and transforms it back into the original message M' using their secret private key, which involves raising C to a different power 'd' and again finding the remainder when divided by 'n' (M' ≡ C^d (mod n)). For example, if Alice wants to send a secret message to Bob, she uses Bob's public key (e, n) to encrypt her message. Only Bob, who knows the secret 'd' (his private key), can decrypt it.

What it doesn't cover

• —Does not cover symmetric encryption systems where the same key is used for both encryption and decryption.
• —Does not cover cryptographic methods that do not rely on modular exponentiation (M^e mod n) for encryption and decryption.
• —Does not cover systems where the modulus 'n' is not the product of two prime numbers, 'p' and 'q', as specified in Claim 1.
• —Does not cover encryption schemes that do not use a public exponent 'e' that is relatively prime to lcm(p-1, q-1), as defined in Claim 1.
• —Does not cover methods for key exchange that don't rely on the specific mathematical properties of RSA, such as Diffie-Hellman.

The clever bit

The true innovation lies in the 'trapdoor function': it's easy to encrypt a message using a public key, but incredibly difficult to reverse the process without a specific piece of secret information (the private key). This asymmetry relies on the mathematical difficulty of factoring large prime numbers.

Why it matters

This patent describes the RSA algorithm, a cornerstone of modern cryptography. It enabled secure digital communications by solving the problem of key distribution, allowing parties to communicate securely without first needing to share a secret key through a secure channel. RSA became widely adopted for securing internet transactions, email, and data storage, fundamentally changing how digital information is protected.

Real-world examples

• 1.Secure Sockets Layer (SSL) and Transport Layer Security (TLS) protocols
• 2.Pretty Good Privacy (PGP) for email encryption
• 3.Digital signatures for software updates and documents
• 4.Virtual Private Networks (VPNs)
• 5.Cryptocurrency wallets and transactions