How RSA Public-Key Encryption Secures Digital Messages

This patent describes the RSA public-key cryptographic system, a method for securely sending digital messages by using a public key to encrypt and a private key to decrypt, based on the mathematical difficulty of factoring large numbers.

What it covers

The patent outlines a cryptographic system for secure communication. An encoding device transforms a message (M) into a secret code (C), called ciphertext, by calculating C ≡ M^e (mod n) (Claim 1B). Here, 'e' is a public exponent and 'n' is a large composite number formed by multiplying two secret prime numbers (p and q). A decoding device then receives this ciphertext (C) and transforms it back into the original message (M') by calculating M' ≡ C^d (mod n) (Claim 1C), where 'd' is a private exponent. For example, if you want to send a secret number, the system uses specific mathematical operations involving powers and remainders after division to scramble it, and only the intended receiver with the correct secret key can unscramble it.

What it doesn't cover

• —Does not cover symmetric encryption systems where the same key is used for both encoding and decoding.
• —Does not cover other public-key cryptosystems not based on modular exponentiation with a modulus 'n' that is the product of two prime numbers (e.g., elliptic curve cryptography).
• —Does not cover methods of key exchange that do not rely on the specific M^e (mod n) and C^d (mod n) transformations described in the claims.
• —Does not cover physical security measures for communication, only the mathematical transformation of digital signals.

The clever bit

The novelty lies in using modular arithmetic with large prime numbers to create a pair of mathematically linked keys: one for encrypting (public) and one for decrypting (private). The clever part is that it's computationally easy to encrypt and decrypt, but practically impossible to derive the private key from the public key without factoring a very large composite number, which is extremely difficult.

Why it matters

This patent describes the RSA algorithm, a foundational technology for public-key cryptography. It enabled secure digital communication and commerce by allowing two parties to communicate securely without first sharing a secret key. This innovation was crucial for the development of the internet and e-commerce, protecting everything from online banking to secure email and digital signatures.

Real-world examples

• 1.Secure Sockets Layer (SSL) / Transport Layer Security (TLS) for secure web browsing (HTTPS)
• 2.Pretty Good Privacy (PGP) for email encryption
• 3.Digital signatures for software and documents
• 4.Virtual Private Networks (VPNs)
• 5.Cryptocurrencies for digital signatures