A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant

DOI10.2307/2007842zbMATH Open0619.10004OpenAlexW4247882173MaRDI QIDQ3755496FDOQ3755496

Martin Seysen

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2007842

zbMATH Keywords

factorizationquadratic formscomputational number theoryprimalityprobabilistic algorithmextended Riemann hypothesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exponential sums (11T23) Primes (11A41) General binary quadratic forms (11E16) Software, source code, etc. for problems pertaining to number theory (11-04)

Cited In (13)

• A Subexponential Algorithm for Evaluating Large Degree Isogenies
• Remarks on the zeta function of some diagonal hyperelliptic curves
• A proof of the conjectured run time of the Hafner-McCurley class group algorithm
• New quadratic polynomials with high densities of prime values
• Smooth ideals in hyperelliptic function fields
• Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
• Mathematical problems in cryptology
• A Rigorous Time Bound for Factoring Integers
• Applying sieving to the computation of quadratic class groups
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Explicit Bounds for Primality Testing and Related Problems
• An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
• Computing Generator in Cyclotomic Integer Rings

This page was built for publication: A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant

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