Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits

DOI10.1007/978-3-642-39059-3_5zbMath1285.94078OpenAlexW6111282MaRDI QIDQ5300936

Yao Lu, Rui Zhang, Dong-Dai Lin

Publication date: 28 June 2013

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39059-3_5

zbMATH Keywords

RSAfactoring with known bitscombined attacks

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (6)

Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Towards Optimal Bounds for Implicit Factorization Problem

This page was built for publication: Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits