suzanne.soy/fork-openpgpjs
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Avoid repeating bases in MillerRabin.

Browse Source
This commit is contained in:
Arlo Breault 2013-06-15 22:39:32 -07:00
parent aa8a7f94f1
commit ab32d1b9e1
1 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/ciphers/asymmetric/jsbn2.js
View File

@ -643,9 +643,15 @@ function bnpMillerRabin(t) {
t = (t+1)>>1;
if(t > lowprimes.length) t = lowprimes.length;
var a = nbi();
var j, bases = [];
for(var i = 0; i < t; ++i) {
//Pick bases at random, instead of starting at 2
a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);
for (;;) {
j = lowprimes[Math.floor(Math.random() * lowprimes.length)];
if (bases.indexOf(j) == -1) break;
}
bases.push(j);
a.fromInt(j);
var y = a.modPow(r,this);
if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
var j = 1;