scientific article
From MaRDI portal
Publication:2785582
zbMath0869.11102MaRDI QIDQ2785582
Sergei V. Konyagin, Carl B. Pomerance
Publication date: 22 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Primality (11Y11)
Related Items (20)
Estimates of trigonometric sums over subgroups and some of their applications ⋮ Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Sharpening ``Primes is in P for a large family of numbers ⋮ On q-orders in primitive modular groups ⋮ Explicit estimates for the distribution of numbers free of large prime factors ⋮ On the distribution of modular inverses from short intervals ⋮ Divisibility of Fermat quotients ⋮ The average least quadratic nonresidue modulo \(m\) and other variations on a theme of Erdős ⋮ An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient ⋮ On the divisibility of Fermat quotients ⋮ List Decoding for Binary Goppa Codes ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Divisors in residue classes, constructively ⋮ Integer factoring and compositeness witnesses ⋮ Some new kinds of pseudoprimes ⋮ An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ Computing prime divisors in an interval ⋮ Generalized strong pseudoprime tests and applications ⋮ Proving primality in essentially quartic random time
This page was built for publication:
