Forty years of attacks on the RSA cryptosystem: A brief survey
From MaRDI portal
Publication:5030492
DOI10.1080/09720529.2018.1564201zbMath1495.94064OpenAlexW2916363687MaRDI QIDQ5030492
Publication date: 17 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2018.1564201
Related Items (3)
On public key cryptosystem based on the word problem in a group ⋮ Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC) ⋮ A novel public-key encryption scheme based on Bass cyclic units in integral group rings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Research on applying physical chaos generator to spacecraft information security
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- Cryptanalysis of `less short' RSA secret exponents
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Security arguments for digital signatures and blind signatures
- A generalized attack on RSA type cryptosystems
- On the security of RSA with primes sharing least-significant bits
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Cryptanalysis of RSA for a special case with \(d > e\)
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- Low-Exponent RSA with Related Messages
- Finding a Small Root of a Univariate Modular Equation
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Continued fractions and RSA with small secret exponent
- Cryptanalysis of short RSA secret exponents
- On the Improvement of the BDF Attack on LSBS-RSA
- Dual RSA and Its Security Analysis
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- Factorization of a 768-Bit RSA Modulus
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- Algorithm for factoring some RSA and Rabin moduli
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
- Solving Simultaneous Modular Equations of Low Degree
- A method for obtaining digital signatures and public-key cryptosystems
- Further Improvement of Factoring RSA Moduli with Implicit Hint
- Blind Signature System
- A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm
- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding
- Comment and modification of RSA based remote password authentication using smart card
- Floating-Point LLL: Theoretical and Practical Aspects
- Advances in Cryptology - EUROCRYPT 2004
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Predicting Lattice Reduction
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
This page was built for publication: Forty years of attacks on the RSA cryptosystem: A brief survey