Apr 09, 21 · The Miller–Rabin primality test or Rabin–Miller primality test is a primality test an algorithm which determines whether a given number is prime or not The algorithm, as modified by Michael O Rabin to avoid the generalized Riemann hypothesis, is a probabilistic algorithm The pseudocode, from Wikipedia is Input n > 2, an odd integer to be tested for primality;W E µ u } v /Z W yD r Ed rhE>yD& ô X ì v ^ À h v o h ¨ ñ U î ð ï X í ñCyclicity of (Z/pn)∗ for an odd prime p Theorem (Gauss) Let p be an odd prime Then for all n > 0, (Z/pn)∗, the group of units in Z/pn, is cyclic Proof We saw in class that (Z/p)∗ is cyclic Let x be a generator, ie, an element of order p− 1 X ƒ}ƒCƒNƒ‰ ƒ|ƒPƒ‚ƒ"mod "ü‚ê•û ƒXƒ}ƒz
