bits >= 347: iterations = 7 case bits >= 308: iterations = 8 case bits >= 55: iterations = 27 default: iterations = 34 } b := make([]byte, (bits+7)/8) for { drbg.Read(b) excess := len(b)*8 - bits b[0] &= 0b1111_1111 >> excess result, err := millerRabinIteration(mr, b) if err != nil { // b was rejected. continue } if result == millerRabinCOMPOSITE { return false } iterations-- if iterations == 0 { return true } } } // primes are the first prime numbers (except 2), such that the product of any // three...

>= 347: iterations = 7 case bits >= 308: iterations = 8 case bits >= 55: iterations = 27 default: iterations = 34 } b := make([]byte, (bits+7)/8) for { drbg.Read(b) if excess := len(b)*8 - bits; excess != 0 { b[0] >>= excess } result, err := millerRabinIteration(mr, b) if err != nil { // b was rejected. continue } if result == millerRabinCOMPOSITE { return false } iterations-- if iterations == 0 { return true } } } // productOfPrimes is the product of the first 74 primes higher than 2. // // The number...