ch08 Introduction to Number Theory 密码编码学与网络安全：原理与实践 第四版英文课件.pptVIP

* The algorithm shown is due to Miller and Rabin is typically used to test a large number for primality. See Stallings section 8.3 for its proof, which relies on some properties of primes that result from Fermat’s theorem. * How can we use the Miller-Rabin algorithm to determine with a high degree of confidence whether or not an integer is prime? If Miller-Rabin returns “composite” the number is definitely not prime, otherwise it is either a prime or a pseudo-prime. The chance it detects a pseudo-prime is 1/4 So if apply test repeatedly with different values of a, the probabiility that the