Cryptanalysis of RSA with private key d less than N/sup 0.292/
From MaRDI portal
Publication:4501744
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
(72)- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Cryptanalysis of Prime Power RSA with two private exponents
- scientific article; zbMATH DE number 4139669 (Why is no real title available?)
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Improved results on cryptanalysis of prime power RSA
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- An application of Euclidean algorithm in cryptanalysis of RSA
- Partial key exposure attack on CRT-RSA
- Using LLL-reduction for solving RSA and factorization problems
- Application of ECM to a class of RSA keys
- Large decryption exponents in RSA
- Cryptanalysis of `less short' RSA secret exponents
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- Speeding up exponentiation using an untrusted computational resource
- A new method for generating keys in the RSA cryptosystem
- Small CRT-Exponent RSA Revisited
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- On a generalization of the Dujella method
- Partial key exposure attacks on RSA with multiple exponent pairs
- Common modulus attacks on small private exponent RSA and some fast variants (in practice)
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- 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
- An improved analysis on three variants of the RSA cryptosystem
- A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations
- A method for obtaining digital signatures and public-key cryptosystems
- A unified framework for small secret exponent attack on RSA
- Further cryptanalysis of a type of RSA variants
- A tool kit for partial key exposure attacks on RSA
- scientific article; zbMATH DE number 7528065 (Why is no real title available?)
- Generalized cryptanalysis of small CRT-exponent RSA
- scientific article; zbMATH DE number 4035724 (Why is no real title available?)
- CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
- Factoring RSA moduli with primes sharing bits in the middle
- Revisiting Wiener’s Attack – New Weak Keys in RSA
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- A new partial key exposure attack on multi-power RSA
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
- Cryptanalysis of RSA with small prime difference
- Partial key exposure: generalized framework to attack RSA
- Cryptanalysis of Dual RSA
- Cryptanalysis of RSA for a special case with \(d > e\)
- Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
- Improving small private exponent attack on the Murru-Saettone cryptosystem
- Revisiting prime power RSA
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- The better bound of private key in RSA with unbalanced primes
- Small CRT-exponent RSA revisited
- Cryptanalysis of RSA with a small parameter revisited
- Partial key exposure attack on short secret exponent CRT-RSA
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of RSA with more than one decryption exponent
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
- Reducing the key size of rainbow using non-commutative rings
- Cryptanalysis of RSA with a small parameter
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- A unified method for private exponent attacks on RSA using lattices
- Fast rebalanced RSA signature scheme with typical prime generation
- Decoding RSA public-key cryptosystem by algorithmic self-assembly
- Finding small roots for bivariate polynomials over the ring of integers
- A New Class of Weak Encryption Exponents in RSA
- Implicit-key attack on the RSA cryptosystem
- A new improved bound for short decryption exponent on RSA modulus \(N = pq\) using Wiener's method
- On the use of RSA as a secret key cryptosystem
- An effective algorithm to private-key in the RSA cryptosystem
- Practical attacks on small private exponent RSA: new records and new insights
- Reduction in lossiness of RSA trapdoor permutation
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)
