Factorization of Square-Free Integers with High Bits Known

DOI10.1007/11958239_8MaRDI QIDQ2876970zbMATH OpenOpenAlexFDO

Authors Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Kazuo Ohta

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

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

Recommendations

• On the Factorization of Squarefree Integers
• On highly factorable numbers
• Factorization of large integers
• scientific article; zbMATH DE number 3970826
• Finding a small root of a bivariate integer equation; factoring with high bits known
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• scientific article; zbMATH DE number 1185143
• scientific article; zbMATH DE number 475434
• Factoring unbalanced moduli with known bits
• Sufficient conditions for factoring a class of large integers

Cited in

(8)

• Further improvement of factoring \(N=p^rq^s\) with partial known bits
• Integer factoring using small algebraic dependencies
• Exploiting the security of N= p^r q^s through approximation of (N)
• Factoring with hints
• Using LLL-reduction for solving RSA and factorization problems
• Finding a small root of a bivariate integer equation; factoring with high bits known
• Fast square-free decomposition of integers using class groups
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876970)