Further improvement of factoring \(N=p^rq^s\) with partial known bits

DOI10.3934/amc.2019007zbMath1405.11153OpenAlexW2905138110MaRDI QIDQ1726017

Huaxiong Wang, Longjiang Qu, Shixiong Wang, Chao Li

Publication date: 15 February 2019

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2019007

zbMATH Keywords

latticeCoppersmith's methodpartial known bitsRSA variant

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items

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

Uses Software

• SageMath

Cites Work

• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• 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
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Factorization of Square-Free Integers with High Bits Known
• On the security of multi-prime RSA
• A method for obtaining digital signatures and public-key cryptosystems
• Attacks on Multi-Prime RSA with Small Prime Difference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item