scientific article

zbMath0571.10004MaRDI QIDQ3688454

Martin Fuerer

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial timecomputational number theoryLucas-Lehmer testMiller-Rabin primality testLas Vegas primality tests

Mathematics Subject Classification ID

Primes (11A41) Algorithms in computer science (68W99)

Related Items (3)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient ⋮ A deterministic version of Pollard’s $p-1$ algorithm

This page was built for publication: