The Miller-Rabin algorithm (Q5950874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1683301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Miller-Rabin algorithm |
scientific article; zbMATH DE number 1683301 |
Statements
The Miller-Rabin algorithm (English)
0 references
18 December 2001
0 references
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.
0 references
Miller-Rabin algorithm
0 references
prime principal ideal
0 references
cyclotomic field
0 references
Miller-Rabin primality testing
0 references
