Cryptanalysis of RSA with small prime difference
From MaRDI portal
Publication:1598120
DOI10.1007/s002000100088zbMath1010.94007OpenAlexW2156666175MaRDI QIDQ1598120
Publication date: 29 May 2002
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000100088
Related Items
An application of Euclidean algorithm in cryptanalysis of RSA ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Classical attacks on a variant of the RSA cryptosystem ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ Cryptanalysis of RSA variants with primes sharing most significant bits ⋮ Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Factoring RSA Moduli with Weak Prime Factors ⋮ Improving small private exponent attack on the Murru-Saettone cryptosystem ⋮ RSA: a number of formulas to improve the search for \(p+q\) ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ Continued fractions applied to a family of RSA-like cryptosystems ⋮ Further cryptanalysis of a type of RSA variants ⋮ Another Generalization of Wiener’s Attack on RSA ⋮ On the Improvement of the BDF Attack on LSBS-RSA ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ The decomposition of an NFSR into the cascade connection of two smaller NFSRs revisited ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Revisiting Wiener’s Attack – New Weak Keys in RSA ⋮ Application of ECM to a class of RSA keys ⋮ On the security of RSA with primes sharing least-significant bits ⋮ Unnamed Item ⋮ 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 ⋮ Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors ⋮ Об обобщении метода Дюжелла ⋮ CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits ⋮ A New Class of Weak Encryption Exponents in RSA ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices
Uses Software
This page was built for publication: Cryptanalysis of RSA with small prime difference
