Live briefing
Everything about RSA problem
Unsolved problem in cryptography
In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a message to an exponent, modulo a composite number N whose factors are not known. Thus, the task can be neatly described as finding the eth roots of an arbitrary number, modulo N. For large RSA key sizes, no efficient method for solving this problem is known; if an efficient method is ever developed, it would threaten the current or eventual security of RSA-based cryptosystems—both for public-key encryption and digital signatures. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: RSA problemA 5-minute orientation
- Skim a recent paper: RSA cryptanalysis — Fermat factorization exact bound and the role of integer sequences in factorization problemInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical NetworksCited 57 times
- Go sideways: RSA cryptosystemA closely related topic
- Go sideways: Rabin cryptosystemA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks
Certificateless ring signature based on RSA problem and DL problem
A new model and algorithm for RSA problem in elastic optical networks
A novel approach to solve RSA problem in the spectrum sliced elastic optical networks
Revisiting RSA-polynomial problem and semiprime factorization
RSA Problem for Varying Traffic in Flexible Optical Networks
A more complete cryptanalysis of the RSA-polynomial problem
Herausgeberkommentar – Krankengeld als Problem in budgetärer Hinsicht und im Morbi-RSA
🆕 Influential since 2022
đź“š Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981- 📕The mathematics of public key cryptographySteven D. Galbraith · 2012
CryptographyDouglas R. Stinson · 1995
An introduction to mathematical cryptographyJeffrey Hoffstein · 2008
Public-Key CryptographyArto Salomaa · 1990
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Cryptography and network securityWilliam Stallings · 2006
Unsolved!Craig P. Bauer · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- RSA cryptosystem The RSA (Rivest–Shamir–Adleman) cryptosystem is a family of public-key cryptosystems (one of the oldest), widely used for secure data transmission. The…
- Rabin cryptosystem The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty…
- Coppersmith's attack Coppersmith's attack describes a class of cryptographic attacks on the public-key cryptosystem RSA based on the Coppersmith method. Particular applications…
- Goldwasser–Micali cryptosystem The Goldwasser–Micali (GM) cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinctio…
- Schmidt-Samoa cryptosystem The Schmidt-Samoa cryptosystem is an asymmetric cryptographic technique, whose security, like Rabin depends on the difficulty of integer factorization…
- Plaintext-aware encryption Plaintext-awareness is a notion of security for public-key encryption. A cryptosystem is plaintext-aware if it is difficult for any efficient algorithm…
- Blum–Goldwasser cryptosystem The Blum–Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is…
- Key encapsulation mechanism In cryptography, a key encapsulation mechanism (KEM) is a public-key cryptosystem that allows a sender to generate a short secret key and transmit it to…