Computation of prime numbers by using a probabilistic algorithm

DOI10.1016/0898-1221(88)90037-5MaRDI QIDQ1104354zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1988

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(88)90037-5

zbMATH Keywords

Miller-Rabin TestPascalprimality testingprobabilistic algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Analysis of algorithms and problem complexity (68Q25)

Review text

Ein Programm für den Miller-Rabin Test in PASCAL.

Cites work

• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality

Cited in

(2)

• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• Deterministic methods to find primes

This page was built for publication: Computation of prime numbers by using a probabilistic algorithm

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