Cryptanalysis of RSA with private key d less than N/sup 0.292/
From MaRDI portal
Publication:4501744
DOI10.1109/18.850673zbMath1001.94031OpenAlexW2019689629MaRDI QIDQ4501744
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
Related Items
An application of Euclidean algorithm in cryptanalysis of RSA, A Unified Framework for Small Secret Exponent Attack on RSA, Reducing the Key Size of Rainbow Using Non-commutative Rings, Cryptanalysis of Prime Power RSA with two private exponents, On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA, Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\), Factoring RSA moduli with primes sharing bits in the middle, Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices, Partial Key Exposure Attack on CRT-RSA, Fast rebalanced RSA signature scheme with typical prime generation, A New Partial Key Exposure Attack on Multi-power RSA, Improving small private exponent attack on the Murru-Saettone cryptosystem, Small secret exponent attack on RSA variant with modulus \(N=p^rq\), Cryptanalytic results on `Dual CRT' and `Common Prime' RSA, Practical attacks on small private exponent RSA: new records and new insights, Further cryptanalysis of a type of RSA variants, Partial key exposure attack on short secret exponent CRT-RSA, Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents, A Tool Kit for Partial Key Exposure Attacks on RSA, An Improved Analysis on Three Variants of the RSA Cryptosystem, Improved Results on Cryptanalysis of Prime Power RSA, Revisiting Wiener’s Attack – New Weak Keys in RSA, Large decryption exponents in RSA, Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound, A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations, Application of ECM to a class of RSA keys, Cryptanalysis of Dual RSA, Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA, A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA, Common modulus attacks on small private exponent RSA and some fast variants (in practice), Small CRT-Exponent RSA Revisited, Small CRT-exponent RSA revisited, Speeding up exponentiation using an untrusted computational resource, A method for obtaining digital signatures and public-key cryptosystems, Using LLL-Reduction for Solving RSA and Factorization Problems, 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, Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents, Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis, Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors, Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures, Speeding-Up Lattice Reduction with Random Projections (Extended Abstract), CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS, Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs, Partial Key Exposure: Generalized Framework to Attack RSA, Generalized cryptanalysis of small CRT-exponent RSA, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, A New Class of Weak Encryption Exponents in RSA, Cryptanalysis of large RSA exponent by using the LLL algorithm, A Unified Method for Private Exponent Attacks on RSA Using Lattices, Security pitfalls of an efficient threshold proxy signature scheme for mobile agents, Cryptanalysis of RSA with a small parameter revisited, Revisiting prime power RSA
