On Primality Tests

DOI10.1137/0211029zbMath0484.10008OpenAlexW2003466166MaRDI QIDQ3943028

Daniel J. Lehmann

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211029

zbMATH Keywords

comparisonextended Riemann hypothesisprobabilistic algorithmprimality test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Primes (11A41)

Related Items (3)

Some results on pseudosquares ⋮ A design of fast pipelined modular multiplier based on a diminished-radix algorithm ⋮ Prime Number Generation Based On Pocklington's Theorem

This page was built for publication: On Primality Tests