The Miller-Rabin algorithm

MaRDI QIDQ5950874zbMATH OpenFDO

Authors O. N. Vasilenko

Publication date 18 December 2001

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

cyclotomic fieldMiller-Rabin algorithmMiller-Rabin primality testingprime principal ideal

Mathematics Subject Classification ID

Cyclotomic extensions (11R18) Primality (11Y11)

Review text

The author presents a probabilistic algorithm that tests whether the principal ideal of an odd natural number \(n\), \(n>1\), is prime in some cyclotomic field.

Cited in

(2)

• Francis’s Algorithm
• Primes in quadratic unique factorization domains

This page was built for publication: The Miller-Rabin algorithm

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