mirror of
https://github.com/the-djmaze/snappymail.git
synced 2026-09-08 17:07:03 +03:00
Move old OpenPGP.js to /vendors instead of npm
This commit is contained in:
djmaze
parent
a7ae087f18
commit
5e63adc904
78 changed files with 39023 additions and 60 deletions
270
vendors/openpgp-2.6.2/src/crypto/public_key/rsa.js
vendored
Normal file
270
vendors/openpgp-2.6.2/src/crypto/public_key/rsa.js
vendored
Normal file
|
|
@ -0,0 +1,270 @@
|
|||
// GPG4Browsers - An OpenPGP implementation in javascript
|
||||
// Copyright (C) 2011 Recurity Labs GmbH
|
||||
//
|
||||
// This library is free software; you can redistribute it and/or
|
||||
// modify it under the terms of the GNU Lesser General Public
|
||||
// License as published by the Free Software Foundation; either
|
||||
// version 3.0 of the License, or (at your option) any later version.
|
||||
//
|
||||
// This library is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
// Lesser General Public License for more details.
|
||||
//
|
||||
// You should have received a copy of the GNU Lesser General Public
|
||||
// License along with this library; if not, write to the Free Software
|
||||
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
//
|
||||
// RSA implementation
|
||||
|
||||
/**
|
||||
* @requires crypto/public_key/jsbn
|
||||
* @requires crypto/random
|
||||
* @requires util
|
||||
* @module crypto/public_key/rsa
|
||||
*/
|
||||
|
||||
'use strict';
|
||||
|
||||
import BigInteger from './jsbn.js';
|
||||
import util from '../../util.js';
|
||||
import random from '../random.js';
|
||||
import config from '../../config';
|
||||
|
||||
function SecureRandom() {
|
||||
function nextBytes(byteArray) {
|
||||
for (var n = 0; n < byteArray.length; n++) {
|
||||
byteArray[n] = random.getSecureRandomOctet();
|
||||
}
|
||||
}
|
||||
this.nextBytes = nextBytes;
|
||||
}
|
||||
|
||||
var blinder = BigInteger.ZERO;
|
||||
var unblinder = BigInteger.ZERO;
|
||||
|
||||
function blind(m, n, e) {
|
||||
if (unblinder.bitLength() === n.bitLength()) {
|
||||
unblinder = unblinder.square().mod(n);
|
||||
} else {
|
||||
unblinder = random.getRandomBigIntegerInRange(BigInteger.TWO, n);
|
||||
}
|
||||
blinder = unblinder.modInverse(n).modPow(e, n);
|
||||
return m.multiply(blinder).mod(n);
|
||||
}
|
||||
|
||||
function unblind(t, n) {
|
||||
return t.multiply(unblinder).mod(n);
|
||||
}
|
||||
|
||||
export default function RSA() {
|
||||
/**
|
||||
* This function uses jsbn Big Num library to decrypt RSA
|
||||
* @param m
|
||||
* message
|
||||
* @param n
|
||||
* RSA public modulus n as BigInteger
|
||||
* @param e
|
||||
* RSA public exponent as BigInteger
|
||||
* @param d
|
||||
* RSA d as BigInteger
|
||||
* @param p
|
||||
* RSA p as BigInteger
|
||||
* @param q
|
||||
* RSA q as BigInteger
|
||||
* @param u
|
||||
* RSA u as BigInteger
|
||||
* @return {BigInteger} The decrypted value of the message
|
||||
*/
|
||||
function decrypt(m, n, e, d, p, q, u) {
|
||||
if (config.rsa_blinding) {
|
||||
m = blind(m, n, e);
|
||||
}
|
||||
var xp = m.mod(p).modPow(d.mod(p.subtract(BigInteger.ONE)), p);
|
||||
var xq = m.mod(q).modPow(d.mod(q.subtract(BigInteger.ONE)), q);
|
||||
util.print_debug("rsa.js decrypt\nxpn:" + util.hexstrdump(xp.toMPI()) + "\nxqn:" + util.hexstrdump(xq.toMPI()));
|
||||
|
||||
var t = xq.subtract(xp);
|
||||
if (t[0] === 0) {
|
||||
t = xp.subtract(xq);
|
||||
t = t.multiply(u).mod(q);
|
||||
t = q.subtract(t);
|
||||
} else {
|
||||
t = t.multiply(u).mod(q);
|
||||
}
|
||||
t = t.multiply(p).add(xp);
|
||||
if (config.rsa_blinding) {
|
||||
t = unblind(t, n);
|
||||
}
|
||||
return t;
|
||||
}
|
||||
|
||||
/**
|
||||
* encrypt message
|
||||
* @param m message as BigInteger
|
||||
* @param e public MPI part as BigInteger
|
||||
* @param n public MPI part as BigInteger
|
||||
* @return BigInteger
|
||||
*/
|
||||
function encrypt(m, e, n) {
|
||||
return m.modPowInt(e, n);
|
||||
}
|
||||
|
||||
/* Sign and Verify */
|
||||
function sign(m, d, n) {
|
||||
return m.modPow(d, n);
|
||||
}
|
||||
|
||||
function verify(x, e, n) {
|
||||
return x.modPowInt(e, n);
|
||||
}
|
||||
|
||||
// "empty" RSA key constructor
|
||||
|
||||
function KeyObject() {
|
||||
this.n = null;
|
||||
this.e = 0;
|
||||
this.ee = null;
|
||||
this.d = null;
|
||||
this.p = null;
|
||||
this.q = null;
|
||||
this.dmp1 = null;
|
||||
this.dmq1 = null;
|
||||
this.u = null;
|
||||
}
|
||||
|
||||
// Generate a new random private key B bits long, using public expt E
|
||||
|
||||
function generate(B, E) {
|
||||
var webCrypto = util.getWebCryptoAll();
|
||||
|
||||
//
|
||||
// Native RSA keygen using Web Crypto
|
||||
//
|
||||
|
||||
if (webCrypto) {
|
||||
var Euint32 = new Uint32Array([parseInt(E, 16)]); // get integer of exponent
|
||||
var Euint8 = new Uint8Array(Euint32.buffer); // get bytes of exponent
|
||||
var keyGenOpt;
|
||||
|
||||
var keys;
|
||||
if (window.crypto && window.crypto.webkitSubtle) {
|
||||
// outdated spec implemented by Webkit
|
||||
keyGenOpt = {
|
||||
name: 'RSA-OAEP',
|
||||
modulusLength: B, // the specified keysize in bits
|
||||
publicExponent: Euint8.subarray(0, 3), // take three bytes (max 65537)
|
||||
hash: {
|
||||
name: 'SHA-1' // not required for actual RSA keys, but for crypto api 'sign' and 'verify'
|
||||
}
|
||||
};
|
||||
keys = webCrypto.generateKey(keyGenOpt, true, ['encrypt', 'decrypt']);
|
||||
}
|
||||
else {
|
||||
// current standard spec
|
||||
keyGenOpt = {
|
||||
name: 'RSASSA-PKCS1-v1_5',
|
||||
modulusLength: B, // the specified keysize in bits
|
||||
publicExponent: Euint8.subarray(0, 3), // take three bytes (max 65537)
|
||||
hash: {
|
||||
name: 'SHA-1' // not required for actual RSA keys, but for crypto api 'sign' and 'verify'
|
||||
}
|
||||
};
|
||||
|
||||
keys = webCrypto.generateKey(keyGenOpt, true, ['sign', 'verify']);
|
||||
if (typeof keys.then !== 'function') { // IE11 KeyOperation
|
||||
keys = util.promisifyIE11Op(keys, 'Error generating RSA key pair.');
|
||||
}
|
||||
}
|
||||
|
||||
return keys.then(exportKey).then(function(key) {
|
||||
if (key instanceof ArrayBuffer) {
|
||||
// parse raw ArrayBuffer bytes to jwk/json (WebKit/Safari/IE11 quirk)
|
||||
return decodeKey(JSON.parse(String.fromCharCode.apply(null, new Uint8Array(key))));
|
||||
}
|
||||
return decodeKey(key);
|
||||
});
|
||||
}
|
||||
|
||||
function exportKey(keypair) {
|
||||
// export the generated keys as JsonWebKey (JWK)
|
||||
// https://tools.ietf.org/html/draft-ietf-jose-json-web-key-33
|
||||
var key = webCrypto.exportKey('jwk', keypair.privateKey);
|
||||
if (typeof key.then !== 'function') { // IE11 KeyOperation
|
||||
key = util.promisifyIE11Op(key, 'Error exporting RSA key pair.');
|
||||
}
|
||||
return key;
|
||||
}
|
||||
|
||||
function decodeKey(jwk) {
|
||||
// map JWK parameters to local BigInteger type system
|
||||
var key = new KeyObject();
|
||||
key.n = toBigInteger(jwk.n);
|
||||
key.ee = new BigInteger(E, 16);
|
||||
key.d = toBigInteger(jwk.d);
|
||||
key.p = toBigInteger(jwk.p);
|
||||
key.q = toBigInteger(jwk.q);
|
||||
key.u = key.p.modInverse(key.q);
|
||||
|
||||
function toBigInteger(base64url) {
|
||||
var base64 = base64url.replace(/\-/g, '+').replace(/_/g, '/');
|
||||
var hex = util.hexstrdump(atob(base64));
|
||||
return new BigInteger(hex, 16);
|
||||
}
|
||||
|
||||
return key;
|
||||
}
|
||||
|
||||
//
|
||||
// JS code
|
||||
//
|
||||
|
||||
return new Promise(function(resolve) {
|
||||
var key = new KeyObject();
|
||||
var rng = new SecureRandom();
|
||||
var qs = B >> 1;
|
||||
key.e = parseInt(E, 16);
|
||||
key.ee = new BigInteger(E, 16);
|
||||
|
||||
for (;;) {
|
||||
for (;;) {
|
||||
key.p = new BigInteger(B - qs, 1, rng);
|
||||
if (key.p.subtract(BigInteger.ONE).gcd(key.ee).compareTo(BigInteger.ONE) === 0 && key.p.isProbablePrime(10)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
for (;;) {
|
||||
key.q = new BigInteger(qs, 1, rng);
|
||||
if (key.q.subtract(BigInteger.ONE).gcd(key.ee).compareTo(BigInteger.ONE) === 0 && key.q.isProbablePrime(10)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (key.p.compareTo(key.q) <= 0) {
|
||||
var t = key.p;
|
||||
key.p = key.q;
|
||||
key.q = t;
|
||||
}
|
||||
var p1 = key.p.subtract(BigInteger.ONE);
|
||||
var q1 = key.q.subtract(BigInteger.ONE);
|
||||
var phi = p1.multiply(q1);
|
||||
if (phi.gcd(key.ee).compareTo(BigInteger.ONE) === 0) {
|
||||
key.n = key.p.multiply(key.q);
|
||||
key.d = key.ee.modInverse(phi);
|
||||
key.dmp1 = key.d.mod(p1);
|
||||
key.dmq1 = key.d.mod(q1);
|
||||
key.u = key.p.modInverse(key.q);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
resolve(key);
|
||||
});
|
||||
}
|
||||
|
||||
this.encrypt = encrypt;
|
||||
this.decrypt = decrypt;
|
||||
this.verify = verify;
|
||||
this.sign = sign;
|
||||
this.generate = generate;
|
||||
this.keyObject = KeyObject;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue