diff options
author | Tom Smeding <hallo@tomsmeding.nl> | 2016-10-24 14:22:24 +0200 |
---|---|---|
committer | tomsmeding <tom.smeding@gmail.com> | 2016-10-24 19:33:53 +0200 |
commit | 7cca53ede2ee4900fce30334fb561a24d1b5d2de (patch) | |
tree | 50ab1737c28d718efa672caef8c1c82ff47475e9 | |
parent | df6c0e07bc74a4137ccb8719a28f58b50ba946c6 (diff) |
ACTUALLY fix strongPseudoPrime2
-rw-r--r-- | .gitignore | 1 | ||||
-rw-r--r-- | bigint.cpp | 10 | ||||
-rw-r--r-- | bigint.h | 1 | ||||
-rw-r--r-- | primes.cpp | 19 | ||||
-rw-r--r-- | primes.h | 1 |
5 files changed, 19 insertions, 13 deletions
@@ -2,3 +2,4 @@ *.dSYM cryptolib.a *.txt +.DS_Store @@ -542,6 +542,16 @@ bool Bigint::odd() const { return !even(); } +int Bigint::trailingZeros() const { + if(digits.size()==0)throw domain_error("trailingZeros called on zero bigint"); + int res=0; + for(digit_t dig : digits){ + if(dig==0)res+=digit_bits; + else return res+__builtin_ctz(dig); + } + assert(false); //bigint is not consistent: zero while digits is not empty! +} + //Produces a string with the bytes of the mantissa in little-endian order. string Bigint::serialiseMantissa() const { string s; @@ -100,6 +100,7 @@ public: slongdigit_t lowdigits() const; bool even() const; bool odd() const; + int trailingZeros() const; //throws domain_error if called on zero value std::string serialiseMantissa() const; //stores everything but the sign void deserialiseMantissa(const std::string&); //restores non-negative number; can throw invalid_argument @@ -109,22 +109,15 @@ bool strongPseudoPrime2(const Bigint &n){ nm1-=1; Bigint d(nm1); - int zerobits=0; - while(d.even()){ - Bigint::slongdigit_t lowdig=d.lowdigits(); - int trzeros; - if(lowdig==0){ - trzeros=8*sizeof(Bigint::slongdigit_t)-1; - } else { - trzeros=__builtin_ctz(d.lowdigits()); - } - zerobits+=trzeros; - d>>=trzeros; - } + int zerobits=d.trailingZeros(); + d>>=zerobits-1; + assert(d.even()); + d>>=1; + assert(d.odd()); Bigint bi(expmod(Bigint::two,d,n)); if(bi==1||bi==nm1)return true; for(int i=1;i<zerobits;i++){ - d<<=1; + bi=(bi*bi).divmod(n).second; if(bi==nm1)return true; } @@ -3,6 +3,7 @@ #include <vector> #include <utility> #include "bigint.h" +#include "rng.h" extern std::vector<int> smallprimes; |