aboutsummaryrefslogtreecommitdiff
path: root/unit-tests.py
diff options
context:
space:
mode:
authorRob Austein <sra@hactrn.net>2017-06-14 00:26:32 -0400
committerRob Austein <sra@hactrn.net>2017-06-14 00:26:32 -0400
commitf21fef907e68ee18762831d0a15cc55513ec740e (patch)
tree3c227cf48ce179e02ead5708b47942dd7aaa086a /unit-tests.py
parentd6b07364680f896252b452e5ada9692267c08e5d (diff)
Faster prime generation algorithm for RSA.
Algorithm suggested by a note in Handbook of Applied Cryptography, motivated by profiling of libtfm fp_isprime() function showing something close to 50% of CPU time spent running Montgomery reductions in the small primes test, before we even get to Miller-Rabin.
Diffstat (limited to 'unit-tests.py')
0 files changed, 0 insertions, 0 deletions