Factorization of Square-Free Integers with High Bits Known

DOI10.1007/11958239_8zbMath1295.11139OpenAlexW2173266376MaRDI QIDQ2876970

Naoki Kanayama, Bagus Santoso, Kazuo Ohta, Noboru Kunihiro

Publication date: 21 August 2014

Published in: Progress in Cryptology - VIETCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11958239_8

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (3)

Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems

This page was built for publication: Factorization of Square-Free Integers with High Bits Known