scientific article; zbMATH DE number 3970826

MaRDI QIDQ3737490zbMATH OpenFDO

Authors D. A. Pljako

Publication date 1986

zbMATH Keywords

sieve methodquadratic diophantine equationfactorization of large integersnon-polynomial complexity

Mathematics Subject Classification ID

Primes (11A41)

Recommendations

• Asymptotically Fast Factorization of Integers
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• scientific article; zbMATH DE number 475434
• scientific article; zbMATH DE number 1185143
• The Multiple Polynomial Quadratic Sieve

Cited in

(12)

• Finding Elements With Given Factorization Lengths and Multiplicities
• Asymptotically Fast Factorization of Integers
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• Factoring Large Numbers on a Pocket Calculator
• Large sieve, Miller-Rabin compositeness witnesses and integer factoring problem
• Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
• Factorization of Square-Free Integers with High Bits Known
• scientific article; zbMATH DE number 4132248 (Why is no real title available?)
• Sufficient conditions for factoring a class of large integers
• Statistical mechanical formulation and simulation of prime factorization of integers
• Factorization of integers
• The distribution of solutions to \(XN=N \pmod a\) with an application to factoring integers

This page was built for publication:

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