MillerRabintesten
MillerRabintesten is a term sometimes used to refer to the Miller–Rabin primality test, a probabilistic algorithm for determining whether a given integer n greater than 1 is prime. It blends ideas from the Miller test and Rabin’s probabilistic framework and is widely employed in number theory and cryptography because it can efficiently handle large numbers.
The method operates on odd integers n by expressing n − 1 as d · 2^s with d odd.
Deterministic variants exist for numbers within specific ranges, where a fixed finite set of bases suffices
See also: Fermat primality test, probabilistic primality tests, primality testing, and primality proving.