(num)
| 25 | return True |
| 26 | |
| 27 | def isPrime(num): |
| 28 | if (num < 2): |
| 29 | return False |
| 30 | |
| 31 | lowPrimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, |
| 32 | 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, |
| 33 | 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, |
| 34 | 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, |
| 35 | 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, |
| 36 | 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, |
| 37 | 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, |
| 38 | 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, |
| 39 | 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, |
| 40 | 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, |
| 41 | 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, |
| 42 | 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, |
| 43 | 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, |
| 44 | 971, 977, 983, 991, 997] |
| 45 | |
| 46 | if num in lowPrimes: |
| 47 | return True |
| 48 | |
| 49 | for prime in lowPrimes: |
| 50 | if (num % prime) == 0: |
| 51 | return False |
| 52 | |
| 53 | return rabinMiller(num) |
| 54 | |
| 55 | def generateLargePrime(keysize = 1024): |
| 56 | while True: |
no test coverage detected