Factoring RSA Moduli with Weak Prime Factors

DOI10.1007/978-3-319-18681-8_29zbMath1441.94090OpenAlexW2265333939MaRDI QIDQ2947096

Tajjeeddine Rachidi, Abderrahmane Nitaj

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-normandie-univ.archives-ouvertes.fr/hal-02320968/file/rsa28final.pdf

zbMATH Keywords

RSAfactorizationcryptanalysisLLL algorithmweak primes

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
• Cryptanalysis of short RSA secret exponents
• Another Generalization of Wiener’s Attack on RSA
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Solving Simultaneous Modular Equations of Low Degree
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292

This page was built for publication: Factoring RSA Moduli with Weak Prime Factors