A note on Rabin's probabilistic primality test

DOI10.1007/BF01933646MaRDI QIDQ3901571zbMATH OpenFDO

Authors Tore Herlestam

Publication date 1980

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01933646

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

• A Fast Monte-Carlo Test for Primality
• scientific article; zbMATH DE number 3630832 (Why is no real title available?)
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality

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

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