r4sas/webogram-i2p
1
0
Fork 0
Code Issues Releases Wiki Activity

Improved modPow for 255-byte results

Browse Source 
Possibly related to #749
This commit is contained in:
Igor Zhukov 2015-03-30 20:34:13 +03:00
parent 8dc14f1504
commit 9ded2c195e
1 changed files with 25 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
app/js/lib/bin_utils.js
View File

@ -191,8 +191,21 @@ function bytesFromWords (wordArray) {
function bytesFromBigInt (bigInt, len) { function bytesFromBigInt (bigInt, len) {
var bytes = bigInt.toByteArray(); var bytes = bigInt.toByteArray();
while (!bytes[0] && (!len || bytes.length > len)) { if (len && bytes.length < len) {
bytes = bytes.slice(1); var padding = [];
for (var i = 0, needPadding = len - bytes.length; i < needPadding; i++) {
padding[i] = 0;
}
if (bytes instanceof ArrayBuffer) {
bytes = bufferConcat(padding, bytes);
} else {
bytes = padding.concat(bytes);
}
}
else {
while (!bytes[0] && (!len || bytes.length > len)) {
bytes = bytes.slice(1);
}
} }
return bytes; return bytes;
@ -320,13 +333,19 @@ function rsaEncrypt (publicKey, bytes) {
return encryptedBytes; return encryptedBytes;
} }
function addPadding(bytes, blockSize) { function addPadding(bytes, blockSize, zeroes) {
blockSize = blockSize || 16; blockSize = blockSize || 16;
var len = bytes.byteLength || bytes.length; var len = bytes.byteLength || bytes.length;
var needPadding = blockSize - (len % blockSize); var needPadding = blockSize - (len % blockSize);
if (needPadding > 0 && needPadding < blockSize) { if (needPadding > 0 && needPadding < blockSize) {
var padding = new Array(needPadding); var padding = new Array(needPadding);
(new SecureRandom()).nextBytes(padding); if (zeroes) {
for (var i = 0; i < needPadding; i++) {
padding[i] = 0
}
} else {
(new SecureRandom()).nextBytes(padding);
}
if (bytes instanceof ArrayBuffer) { if (bytes instanceof ArrayBuffer) {
bytes = bufferConcat(bytes, padding); bytes = bufferConcat(bytes, padding);
@ -383,7 +402,7 @@ function nextRandomInt (maxValue) {
}; };
function pqPrimeFactorization (pqBytes) { function pqPrimeFactorization (pqBytes) {
var what = new BigInteger(pqBytes), var what = new BigInteger(pqBytes),
result = false; result = false;
// console.log(dT(), 'PQ start', pqBytes, what.toString(16), what.bitLength()); // console.log(dT(), 'PQ start', pqBytes, what.toString(16), what.bitLength());
@ -635,5 +654,5 @@ function bytesModPow (x, y, m) {
console.error('mod pow error', e); console.error('mod pow error', e);
} }
return bytesFromBigInt(new BigInteger(x).modPow(new BigInteger(y), new BigInteger(m))); return bytesFromBigInt(new BigInteger(x).modPow(new BigInteger(y), new BigInteger(m)), 256);
} }