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

ESLint

Browse Source
This commit is contained in:
KAYLukas 2018-03-07 00:50:26 +01:00
parent 0684fb760e
commit 59d2973c05
1 changed files with 18 additions and 12 deletions

30
src/crypto/public_key/prime.js
View File

@ -27,7 +27,7 @@ import BN from 'bn.js';
import random from '../random'; import random from '../random';
export default { export default {
randomProbablePrime, isProbablePrime, fermat, millerRabin, division_test randomProbablePrime, isProbablePrime, fermat, millerRabin, divisionTest
}; };
/** /**
@ -51,7 +51,7 @@ async function randomProbablePrime(bits, e, k) {
let n = await random.getRandomBN(min, min.shln(1)); let n = await random.getRandomBN(min, min.shln(1));
let i = n.mod(thirty).toNumber(); let i = n.mod(thirty).toNumber();
do { do {
n.iaddn(adds[i]); n.iaddn(adds[i]);
i = (i + adds[i]) % adds.length; i = (i + adds[i]) % adds.length;
// If reached the maximum, go back to the minimum. // If reached the maximum, go back to the minimum.
@ -74,7 +74,7 @@ async function isProbablePrime(n, e, k) {
if (e && !n.subn(1).gcd(e).eqn(1)) { if (e && !n.subn(1).gcd(e).eqn(1)) {
return false; return false;
} }
if (!division_test(n)) { if (!divisionTest(n)) {
return false; return false;
} }
if (!fermat(n)) { if (!fermat(n)) {
@ -100,7 +100,7 @@ function fermat(n, b) {
return b.toRed(BN.mont(n)).redPow(n.subn(1)).fromRed().cmpn(1) === 0; return b.toRed(BN.mont(n)).redPow(n.subn(1)).fromRed().cmpn(1) === 0;
} }
function division_test(n) { function divisionTest(n) {
return small_primes.every(m => { return small_primes.every(m => {
return n.modn(m) !== 0; return n.modn(m) !== 0;
}); });
@ -186,7 +186,8 @@ const small_primes = [
4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799,
4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889,
4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951,
4957, 4967, 4969, 4973, 4987, 4993, 4999]; 4957, 4967, 4969, 4973, 4987, 4993, 4999
];
// Miller-Rabin - Miller Rabin algorithm for primality test // Miller-Rabin - Miller Rabin algorithm for primality test
@ -231,8 +232,9 @@ async function millerRabin(n, k, rand) {
const red = BN.mont(n); const red = BN.mont(n);
const rone = new BN(1).toRed(red); const rone = new BN(1).toRed(red);
if (!k) if (!k) {
k = Math.max(1, (len / 48) | 0); k = Math.max(1, (len / 48) | 0);
}
const n1 = n.subn(1); const n1 = n.subn(1);
const rn1 = n1.toRed(red); const rn1 = n1.toRed(red);
@ -244,25 +246,29 @@ async function millerRabin(n, k, rand) {
for (; k > 0; k--) { for (; k > 0; k--) {
// eslint-disable-next-line no-await-in-loop // eslint-disable-next-line no-await-in-loop
let a = rand ? rand() : await random.getRandomBN(new BN(2), n1); const a = rand ? rand() : await random.getRandomBN(new BN(2), n1);
let x = a.toRed(red).redPow(d); let x = a.toRed(red).redPow(d);
if (x.eq(rone) || x.eq(rn1)) if (x.eq(rone) || x.eq(rn1)) {
continue; continue;
}
let i; let i;
for (i = 1; i < s; i++) { for (i = 1; i < s; i++) {
x = x.redSqr(); x = x.redSqr();
if (x.eq(rone)) if (x.eq(rone)) {
return false; return false;
if (x.eq(rn1)) }
if (x.eq(rn1)) {
break; break;
}
} }
if (i === s) if (i === s) {
return false; return false;
}
} }
return true; return true;
}; }