On Primality Tests

DOI10.1137/0211029MaRDI QIDQ3943028zbMATH OpenOpenAlexFDO

Authors Daniel 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 hypothesisprimality testprobabilistic algorithm

Mathematics Subject Classification ID

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

Cited in

(3)

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

This page was built for publication: On Primality Tests

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