Exploiting the security of N = prqs through approximation of ϕ(N)

DOI10.1142/S1793830921501445zbMath1492.94053OpenAlexW3173766149WikidataQ114978407 ScholiaQ114978407MaRDI QIDQ5083870

Saidu Isah Abubakar, Sadiq Shehu

Publication date: 21 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501445

zbMATH Keywords

factorizationcontinued fractionsimultaneous Diophantine approximationsLLL algorithmmulti prime power

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55) Simultaneous homogeneous approximation, linear forms (11J13)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revisiting prime power RSA
• Factoring polynomials with rational coefficients
• Cryptanalysis of RSA with small prime difference
• Further improvement of factoring \(N=p^rq^s\) with partial known bits
• Improved factorization of \(N=p^rq^s\)
• Improved factoring attacks on multi-prime RSA with small prime difference
• Factoring $$N=p^rq^s$$ for Large r and s
• Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem
• Factorization of Square-Free Integers with High Bits Known
• Mathematical Foundations of Public Key Cryptography
• Cryptanalysis of short RSA secret exponents
• On the security of multi-prime RSA
• Revisiting Wiener’s Attack – New Weak Keys in RSA
• A method for obtaining digital signatures and public-key cryptosystems
• New Attacks on the RSA Cryptosystem

This page was built for publication: Exploiting the security of N = prqs through approximation of ϕ(N)