A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
From MaRDI portal
Publication:3755496
DOI10.2307/2007842zbMath0619.10004OpenAlexW4247882173MaRDI QIDQ3755496
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2007842
quadratic formsextended Riemann hypothesisfactorizationprimalityprobabilistic algorithmcomputational number theory
Analysis of algorithms and problem complexity (68Q25) Exponential sums (11T23) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) General binary quadratic forms (11E16)
Related Items (13)
New quadratic polynomials with high densities of prime values ⋮ Remarks on the zeta function of some diagonal hyperelliptic curves ⋮ Smooth ideals in hyperelliptic function fields ⋮ Mathematical problems in cryptology ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ A Subexponential Algorithm for Evaluating Large Degree Isogenies ⋮ A Rigorous Time Bound for Factoring Integers ⋮ A Rigorous Subexponential Algorithm For Computation of Class Groups ⋮ Explicit Bounds for Primality Testing and Related Problems ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Applying sieving to the computation of quadratic class groups
This page was built for publication: A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
