A note on Rabin's probabilistic primality test

DOI10.1007/BF01933646zbMath0454.10002MaRDI QIDQ3901571

Tore Herlestam

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Carmichael numbersnumerical efficiencyprimality testingstrong pseudo-primes

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Cites Work

• Unnamed Item
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• A Fast Monte-Carlo Test for Primality

This page was built for publication: A note on Rabin's probabilistic primality test