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

Including @arlolra changes to improve MillerRabin

Browse Source
This commit is contained in:
seancolyer 2013-10-09 19:16:31 -04:00
parent 7abaa43497
commit 11acf33665
3 changed files with 17 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
resources/openpgp.js
View File

@ -1329,7 +1329,7 @@ function openpgp_config() {
keyserver: "keyserver.linux.it" // "pgp.mit.edu:11371" keyserver: "keyserver.linux.it" // "pgp.mit.edu:11371"
}; };
this.versionstring = "OpenPGP.js v0.0.1.20131008"; this.versionstring = "OpenPGP.js v0.0.1.20131009";
this.commentstring = "http://openpgpjs.org"; this.commentstring = "http://openpgpjs.org";
/** /**
* Reads the config out of the HTML5 local storage * Reads the config out of the HTML5 local storage
@ -7906,9 +7906,15 @@ function bnpMillerRabin(t) {
t = (t + 1) >> 1; t = (t + 1) >> 1;
if (t > lowprimes.length) t = lowprimes.length; if (t > lowprimes.length) t = lowprimes.length;
var a = nbi(); var a = nbi();
var j, bases = [];
for (var i = 0; i < t; ++i) { for (var i = 0; i < t; ++i) {
//Pick bases at random, instead of starting at 2 //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); var y = a.modPow(r, this);
if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) { if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
var j = 1; var j = 1;

4
resources/openpgp.min.js vendored
View File

File diff suppressed because one or more lines are too long

8
src/crypto/public_key/jsbn.js
View File

@ -1626,9 +1626,15 @@ function bnpMillerRabin(t) {
t = (t + 1) >> 1; t = (t + 1) >> 1;
if (t > lowprimes.length) t = lowprimes.length; if (t > lowprimes.length) t = lowprimes.length;
var a = nbi(); var a = nbi();
var j, bases = [];
for (var i = 0; i < t; ++i) { for (var i = 0; i < t; ++i) {
//Pick bases at random, instead of starting at 2 //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); var y = a.modPow(r, this);
if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) { if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
var j = 1; var j = 1;