Cryptanalysis of RSA with private key d less than N/sup 0.292/
From MaRDI portal
Publication:4501744
DOI10.1109/18.850673zbMATH Open1001.94031OpenAlexW2019689629MaRDI QIDQ4501744FDOQ4501744
Authors: Dan Boneh, Glenn Durfee 
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850673
Recommendations
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of `less short' RSA secret exponents
- Cryptanalysis of RSA with a small parameter
- Cryptanalysis of RSA with a small parameter revisited
- Cryptanalysis of RSA for a special case with \(d > e\)
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- scientific article; zbMATH DE number 1302812
Cited In (68)
- Finding small roots for bivariate polynomials over the ring of integers
- Decoding RSA public-key cryptosystem by algorithmic self-assembly
- Reduction in lossiness of RSA trapdoor permutation
- On the use of RSA as a secret key cryptosystem
- A New Class of Weak Encryption Exponents in RSA
- Implicit-key attack on the RSA cryptosystem
- Practical attacks on small private exponent RSA: new records and new insights
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Generalized cryptanalysis of small CRT-exponent RSA
- A Unified Method for Private Exponent Attacks on RSA Using Lattices
- Revisiting prime power RSA
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- An application of Euclidean algorithm in cryptanalysis of RSA
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- A unified framework for small secret exponent attack on RSA
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Title not available (Why is that?)
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
- A Tool Kit for Partial Key Exposure Attacks on RSA
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- The better bound of private key in RSA with unbalanced primes
- Large decryption exponents in RSA
- Further cryptanalysis of a type of RSA variants
- Small CRT-exponent RSA revisited
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Cryptanalysis of `less short' RSA secret exponents
- Speeding up exponentiation using an untrusted computational resource
- Partial key exposure: generalized framework to attack RSA
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of RSA with more than one decryption exponent
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
- Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
- Cryptanalysis of RSA with a small parameter revisited
- An Improved Analysis on Three Variants of the RSA Cryptosystem
- Partial key exposure attack on short secret exponent CRT-RSA
- Title not available (Why is that?)
- Cryptanalysis of RSA with a small parameter
- Partial Key Exposure Attack on CRT-RSA
- Factoring RSA moduli with primes sharing bits in the middle
- A New Partial Key Exposure Attack on Multi-power RSA
- Cryptanalysis of RSA with small prime difference
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Improved Results on Cryptanalysis of Prime Power RSA
- Cryptanalysis of RSA for a special case with \(d > e\)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Using LLL-reduction for solving RSA and factorization problems
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Application of ECM to a class of RSA keys
- CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
- Improving small private exponent attack on the Murru-Saettone cryptosystem
- Reducing the key size of rainbow using non-commutative rings
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- Cryptanalysis of Prime Power RSA with two private exponents
- Fast rebalanced RSA signature scheme with typical prime generation
- Title not available (Why is that?)
- Small CRT-Exponent RSA Revisited
- A method for obtaining digital signatures and public-key cryptosystems
- Revisiting Wiener’s Attack – New Weak Keys in RSA
- Common modulus attacks on small private exponent RSA and some fast variants (in practice)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Cryptanalysis of Dual RSA
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
This page was built for publication: Cryptanalysis of RSA with private key d less than N/sup 0.292/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501744)
