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.
Original patent title: “Cryptographic communications system and method”
What this patent covers
The actual claim
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 this patent does NOT cover
The boundaries
- 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.
These exclusions are unique to PatentBrief — derived from the actual claim language, not patent-office boilerplate.
What made this novel
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.
Schematic visualization of the patent's claim structure. Hand-drawn diagrams in progress for each landmark patent.
Where you've seen this
Real-world examples
Secure Sockets Layer (SSL) / Transport Layer Security (TLS) for secure web browsing (HTTPS)
Pretty Good Privacy (PGP) for email encryption
Digital signatures for software and documents
Virtual Private Networks (VPNs)
Cryptocurrencies for digital signatures
Why it matters
The bigger picture
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.
Filed
December 14, 1977
Granted
September 20, 1983
Market context
Who's building on this
Companies in this space
The principles of RSA are fundamental to nearly all major technology companies that handle secure data. Companies like Google, Microsoft, Apple, Amazon, and IBM rely on RSA or similar public-key cryptography for their cloud services, operating systems, and secure communication protocols. Cybersecurity firms and financial institutions also heavily utilize these concepts to protect sensitive information.
Market impact
The RSA algorithm, as described in this patent, revolutionized secure communication. It enabled the widespread adoption of public-key cryptography, which was essential for the growth of the internet by providing a secure way to exchange information and conduct transactions. This led to the creation of new industries in cybersecurity, e-commerce, and digital identity, fundamentally changing how businesses and individuals interact online.
Claim 1 — Plain English
What this patent 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.
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.
What it does not 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.
Patent Journey
From filing to expiry
Patent Filed
1977
Patent Granted
1983 · 6yr after filing
Highly Cited
1,015 patents cite this
Patent Expired
1997
PatentBrief Score
Impact Score
Strong
Citation count
40/40
Highly cited
Claim breadth
20/20
Very broad protection
Recency
0/20
Older than 20 years
Assignee scale
0/20
Independent or smaller assignee
PatentBrief Impact Score — based on citation count, claim breadth, recency, and assignee scale. Not a legal assessment.
The original legal language
Original claims
52 claims as filed with the patent office.
Citations
Patent lineage
Stay in the loop
Get a weekly digest of new patents.
One email per week. No spam. Unsubscribe anytime.
Keep exploring
Related patents you should know
US 12564871 · 2026
A Fixture for Cleaning Showerheads with Multiple Separate Chambers
This patent describes a cleaning device for showerheads that uses a fixture with three or more separate internal compartments and channels to direct cleaning fluid to the showerhead's upper surfaces.
ASM IP HOLDING BV
US 12324579 · 2025
Surgical Stapler Battery Health Check During Operation
This patent describes a powered surgical stapler that can detect if some of its rechargeable battery cells are damaged while it's actually firing staples, helping ensure the procedure finishes safely.
CILAG GMBH INT
US 12471982 · 2025
Surgical Tool That Combines Energy Treatment and Stapling
CILAG's patent details a surgical instrument that applies therapeutic energy to tissue, monitors its properties, then deploys staples, adapting the stapling based on the initial energy treatment and monitoring.
CILAG GMBH INT
US 11918209 · 2024
Real-Time Surgical Instrument Status on Live Video During Operations
This patent describes a surgical system that shows live video from inside the body and overlays important information about the surgical tool directly onto the screen, helping surgeons operate more precisely.
CILAG GMBH INT
US 8697359 · 2014
How to Use CRISPR-Cas9 to Edit Genes in Human Cells
This patent describes a method and system for precisely altering gene expression in eukaryotic cells, including human cells, using an engineered CRISPR-Cas9 system that targets and cleaves specific DNA sequences.
Massachusetts Institute of Technology
US 4683195 · 1987
How to Make Many Copies of a Specific DNA Segment
This patent describes the Polymerase Chain Reaction (PCR), a fundamental process for making millions of copies of a specific DNA or RNA segment from a tiny sample, enabling its detection.
Cetus Corp
Semantically similar
You might also find these interesting
US 4200770 · 1980 · Leland Stanford Junior University
The Math That Makes Every HTTPS Connection Secure
US 4063220 · 1977 · Xerox Corp
How Computers Share a Network Cable Without Crashing
US 4558302 · 1985 · Sperry Corp
How Computers Shrink Data by Finding Repeated Patterns
US 2292387 · 1942
Hedy Lamarr's Secret Radio System for Torpedo Guidance
Same assignee
More from Massachusetts Institute of Technology
Patent monitoring