diff options
author | Sybren A. Stüvel <sybren@stuvel.eu> | 2011-07-23 11:05:41 +0200 |
---|---|---|
committer | Sybren A. Stüvel <sybren@stuvel.eu> | 2011-07-23 11:05:41 +0200 |
commit | bb43248bcb1025c31c7d8b98fe0b5fd1dc05cf2f (patch) | |
tree | f11c77388f74a7dd04cea545c404ae9678e70266 | |
parent | 7f7127077ce31f2ab250de0b2acccd89219ef720 (diff) | |
download | rsa-git-bb43248bcb1025c31c7d8b98fe0b5fd1dc05cf2f.tar.gz |
Slight simplification of is_prime
-rw-r--r-- | rsa/prime.py | 18 |
1 files changed, 6 insertions, 12 deletions
diff --git a/rsa/prime.py b/rsa/prime.py index 3edf392..d477569 100644 --- a/rsa/prime.py +++ b/rsa/prime.py @@ -67,29 +67,23 @@ def is_prime(number): """Returns True if the number is prime, and False otherwise. >>> is_prime(42) - 0 + False >>> is_prime(41) - 1 + True """ - if randomized_primality_testing(number, 6): - # Prime, according to Jacobi - return True - - # Not prime - return False + return randomized_primality_testing(number, 6) - def getprime(nbits): """Returns a prime number that can be stored in 'nbits' bits. >>> p = getprime(128) >>> is_prime(p-1) - 0 + False >>> is_prime(p) - 1 + True >>> is_prime(p+1) - 0 + False >>> from rsa import common >>> common.bit_size(p) <= 128 |