Cryptanalysis of RSA with Private Key d Less than N 0.292
From MaRDI portal
Publication:4250748
DOI10.1007/3-540-48910-X_1zbMath0948.94009OpenAlexW1553510179MaRDI QIDQ4250748
Publication date: 26 November 2000
Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-48910-x_1
Related Items (40)
Cryptanalysis of Prime Power RSA with two private exponents ⋮ Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization ⋮ Classical attacks on a variant of the RSA cryptosystem ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ Integer LWE with non-subgaussian error and related attacks ⋮ Cryptanalysis of RSA variants with primes sharing most significant bits ⋮ A variant of Wiener's attack on RSA ⋮ Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents ⋮ A generalized attack on RSA type cryptosystems ⋮ New Attacks on RSA with Moduli N = p r q ⋮ Factoring RSA Moduli with Weak Prime Factors ⋮ Small secret exponent attack on RSA variant with modulus \(N=p^rq\) ⋮ A new attack on some RSA variants ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ Another Generalization of Wiener’s Attack on RSA ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ The better bound of private key in RSA with unbalanced primes ⋮ A generalized attack on some variants of the RSA cryptosystem ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ On the optimality of lattices for the Coppersmith technique ⋮ On the number of sparse RSA exponents ⋮ Unnamed Item ⋮ Cryptanalysis of RSA for a special case with \(d > e\) ⋮ A method for obtaining digital signatures and public-key cryptosystems ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ A new generalization of the KMOV cryptosystem ⋮ A new attack on RSA with two or three decryption exponents ⋮ Об обобщении метода Дюжелла ⋮ Predicting Lattice Reduction ⋮ A New Attack on Three Variants of the RSA Cryptosystem ⋮ Cryptanalysis of RSA Using the Ratio of the Primes ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits ⋮ A small secret exponent attack on cryptosystems using Dickson polynomials ⋮ A New Class of Weak Encryption Exponents in RSA ⋮ Unnamed Item ⋮ Cryptanalysis of RSA with a small parameter revisited ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem
This page was built for publication: Cryptanalysis of RSA with Private Key d Less than N 0.292
