Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //
- // JavaScript SHA1
- //
- function rl(n,s)
- {
- return ( n << s ) | (n >>> (32-s));
- }
- function cvt(val)
- {
- var str="";
- var i;
- var v;
- for( i=7; i>=0; i-- )
- {
- v = (val >>> (i*4))&0x0f;
- str = str+ v.toString(16);
- }
- return str;
- }
- function SHA1(str)
- {
- var blk;
- var i, j;
- var W = new Array(80);
- var h0 = 0x67452301;
- var h1 = 0xEFCDAB89;
- var h2 = 0x98BADCFE;
- var h3 = 0x10325476;
- var h4 = 0xC3D2E1F0;
- var a, b, c, d, e;
- var temp;
- var msg_length = str.length;
- var words = new Array();
- for( i=0; i<msg_length-3; i+=4 )
- words.push(str.charCodeAt(i) << 24 | str.charCodeAt(i+1) << 16 | str.charCodeAt(i+2) << 8 | str.charCodeAt(i+3));
- switch( msg_length % 4 )
- {
- case 0:
- i = 0x080000000;
- break;
- case 1:
- i = str.charCodeAt(msg_length-1) << 24 | 0x0800000;
- break;
- case 2:
- i = str.charCodeAt(msg_length-2) << 24 | str.charCodeAt(msg_length-1) << 16 | 0x08000;
- break;
- case 3:
- i = str.charCodeAt(msg_length-3) << 24 | str.charCodeAt(msg_length-2) << 16 | str.charCodeAt(msg_length-1) << 8 | 0x80;
- break;
- }
- words.push( i );
- while( (words.length % 16) != 14 )
- words.push( 0 );
- words.push( msg_length >>> 29 );
- words.push( (msg_length << 3) & 0x0ffffffff );
- for ( blk=0; blk<words.length; blk+=16 )
- {
- for( i=0; i<16; i++ )
- W[i] = words[blk+i];
- for( i=16; i<=79; i++ )
- W[i] = rl(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1);
- a = h0;
- b = h1;
- c = h2;
- d = h3;
- e = h4;
- for( i= 0; i<=19; i++ )
- {
- temp = (rl(a,5) + ((b&c) | (~b&d)) + e + W[i] + 0x5A827999) & 0x0ffffffff;
- e = d;
- d = c;
- c = rl(b,30);
- b = a;
- a = temp;
- }
- for( i=20; i<=39; i++ )
- {
- temp = (rl(a,5) + (b ^ c ^ d) + e + W[i] + 0x6ED9EBA1) & 0x0ffffffff;
- e = d;
- d = c;
- c = rl(b,30);
- b = a;
- a = temp;
- }
- for( i=40; i<=59; i++ )
- {
- temp = (rl(a,5) + ((b&c) | (b&d) | (c&d)) + e + W[i] + 0x8F1BBCDC) & 0x0ffffffff;
- e = d;
- d = c;
- c = rl(b,30);
- b = a;
- a = temp;
- }
- for( i=60; i<=79; i++ )
- {
- temp = (rl(a,5) + (b ^ c ^ d) + e + W[i] + 0xCA62C1D6) & 0x0ffffffff;
- e = d;
- d = c;
- c = rl(b,30);
- b = a;
- a = temp;
- }
- h0 = (h0 + a) & 0x0ffffffff;
- h1 = (h1 + b) & 0x0ffffffff;
- h2 = (h2 + c) & 0x0ffffffff;
- h3 = (h3 + d) & 0x0ffffffff;
- h4 = (h4 + e) & 0x0ffffffff;
- }
- return cvt(h0) + cvt(h1) + cvt(h2) + cvt(h3) + cvt(h4);
- }
- // This code was written by Tyler Akins and has been placed in the
- // public domain. It would be nice if you left this header intact.
- // Base64 code from Tyler Akins -- http://rumkin.com
- var ua = navigator.userAgent.toLowerCase();
- if (ua.indexOf(" chrome/") >= 0 || ua.indexOf(" firefox/") >= 0 || ua.indexOf(' gecko/') >= 0) {
- var StringMaker = function () {
- this.str = "";
- this.length = 0;
- this.append = function (s) {
- this.str += s;
- this.length += s.length;
- }
- this.prepend = function (s) {
- this.str = s + this.str;
- this.length += s.length;
- }
- this.toString = function () {
- return this.str;
- }
- }
- } else {
- var StringMaker = function () {
- this.parts = [];
- this.length = 0;
- this.append = function (s) {
- this.parts.push(s);
- this.length += s.length;
- }
- this.prepend = function (s) {
- this.parts.unshift(s);
- this.length += s.length;
- }
- this.toString = function () {
- return this.parts.join('');
- }
- }
- }
- var keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
- function encode64(input) {
- var output = new StringMaker();
- var chr1, chr2, chr3;
- var enc1, enc2, enc3, enc4;
- var i = 0;
- while (i < input.length) {
- chr1 = input.charCodeAt(i++);
- chr2 = input.charCodeAt(i++);
- chr3 = input.charCodeAt(i++);
- enc1 = chr1 >> 2;
- enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
- enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
- enc4 = chr3 & 63;
- if (isNaN(chr2)) {
- enc3 = enc4 = 64;
- } else if (isNaN(chr3)) {
- enc4 = 64;
- }
- output.append(keyStr.charAt(enc1) + keyStr.charAt(enc2) + keyStr.charAt(enc3) + keyStr.charAt(enc4));
- }
- return output.toString();
- }
- function decode64(input) {
- var output = new StringMaker();
- var chr1, chr2, chr3;
- var enc1, enc2, enc3, enc4;
- var i = 0;
- // remove all characters that are not A-Z, a-z, 0-9, +, /, or =
- input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
- while (i < input.length) {
- enc1 = keyStr.indexOf(input.charAt(i++));
- enc2 = keyStr.indexOf(input.charAt(i++));
- enc3 = keyStr.indexOf(input.charAt(i++));
- enc4 = keyStr.indexOf(input.charAt(i++));
- chr1 = (enc1 << 2) | (enc2 >> 4);
- chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
- chr3 = ((enc3 & 3) << 6) | enc4;
- output.append(String.fromCharCode(chr1));
- if (enc3 != 64) {
- output.append(String.fromCharCode(chr2));
- }
- if (enc4 != 64) {
- output.append(String.fromCharCode(chr3));
- }
- }
- return output.toString();
- }
- function decode64_2hex(input) {
- var output = new StringMaker();
- var chr1, chr2, chr3;
- var enc1, enc2, enc3, enc4;
- var i = 0;
- // remove all characters that are not A-Z, a-z, 0-9, +, /, or =
- input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
- while (i < input.length) {
- enc1 = keyStr.indexOf(input.charAt(i++));
- enc2 = keyStr.indexOf(input.charAt(i++));
- enc3 = keyStr.indexOf(input.charAt(i++));
- enc4 = keyStr.indexOf(input.charAt(i++));
- chr1 = (enc1 << 2) | (enc2 >> 4);
- chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
- chr3 = ((enc3 & 3) << 6) | enc4;
- output.append(String.fromCharCode(chr1));
- if (enc3 != 64) {
- output.append(String.fromCharCode(chr2));
- }
- if (enc4 != 64) {
- output.append(String.fromCharCode(chr3));
- }
- }
- return output.toString();
- }
- // BigInt, a suite of routines for performing multiple-precision arithmetic in
- // JavaScript.
- //
- // Copyright 1998-2005 David Shapiro.
- //
- // You may use, re-use, abuse,
- // copy, and modify this code to your liking, but please keep this header.
- // Thanks!
- //
- // Dave Shapiro
- // dave@ohdave.com
- // IMPORTANT THING: Be sure to set maxDigits according to your precision
- // needs. Use the setMaxDigits() function to do this. See comments below.
- //
- // Tweaked by Ian Bunning
- // Alterations:
- // Fix bug in function biFromHex(s) to allow
- // parsing of strings of length != 0 (mod 4)
- // Changes made by Dave Shapiro as of 12/30/2004:
- //
- // The BigInt() constructor doesn't take a string anymore. If you want to
- // create a BigInt from a string, use biFromDecimal() for base-10
- // representations, biFromHex() for base-16 representations, or
- // biFromString() for base-2-to-36 representations.
- //
- // biFromArray() has been removed. Use biCopy() instead, passing a BigInt
- // instead of an array.
- //
- // The BigInt() constructor now only constructs a zeroed-out array.
- // Alternatively, if you pass <true>, it won't construct any array. See the
- // biCopy() method for an example of this.
- //
- // Be sure to set maxDigits depending on your precision needs. The default
- // zeroed-out array ZERO_ARRAY is constructed inside the setMaxDigits()
- // function. So use this function to set the variable. DON'T JUST SET THE
- // VALUE. USE THE FUNCTION.
- //
- // ZERO_ARRAY exists to hopefully speed up construction of BigInts(). By
- // precalculating the zero array, we can just use slice(0) to make copies of
- // it. Presumably this calls faster native code, as opposed to setting the
- // elements one at a time. I have not done any timing tests to verify this
- // claim.
- // Max number = 10^16 - 2 = 9999999999999998;
- // 2^53 = 9007199254740992;
- var biRadixBase = 2;
- var biRadixBits = 16;
- var bitsPerDigit = biRadixBits;
- var biRadix = 1 << 16; // = 2^16 = 65536
- var biHalfRadix = biRadix >>> 1;
- var biRadixSquared = biRadix * biRadix;
- var maxDigitVal = biRadix - 1;
- var maxInteger = 9999999999999998;
- // maxDigits:
- // Change this to accommodate your largest number size. Use setMaxDigits()
- // to change it!
- //
- // In general, if you're working with numbers of size N bits, you'll need 2*N
- // bits of storage. Each digit holds 16 bits. So, a 1024-bit key will need
- //
- // 1024 * 2 / 16 = 128 digits of storage.
- //
- var maxDigits;
- var ZERO_ARRAY;
- var bigZero, bigOne;
- function setMaxDigits(value)
- {
- maxDigits = value;
- ZERO_ARRAY = new Array(maxDigits);
- for (var iza = 0; iza < ZERO_ARRAY.length; iza++) ZERO_ARRAY[iza] = 0;
- bigZero = new BigInt();
- bigOne = new BigInt();
- bigOne.digits[0] = 1;
- }
- setMaxDigits(20);
- // The maximum number of digits in base 10 you can convert to an
- // integer without JavaScript throwing up on you.
- var dpl10 = 15;
- // lr10 = 10 ^ dpl10
- var lr10 = biFromNumber(1000000000000000);
- function BigInt(flag)
- {
- if (typeof flag == "boolean" && flag == true) {
- this.digits = null;
- }
- else {
- this.digits = ZERO_ARRAY.slice(0);
- }
- this.isNeg = false;
- }
- function biFromDecimal(s)
- {
- var isNeg = s.charAt(0) == '-';
- var i = isNeg ? 1 : 0;
- var result;
- // Skip leading zeros.
- while (i < s.length && s.charAt(i) == '0') ++i;
- if (i == s.length) {
- result = new BigInt();
- }
- else {
- var digitCount = s.length - i;
- var fgl = digitCount % dpl10;
- if (fgl == 0) fgl = dpl10;
- result = biFromNumber(Number(s.substr(i, fgl)));
- i += fgl;
- while (i < s.length) {
- result = biAdd(biMultiply(result, lr10),
- biFromNumber(Number(s.substr(i, dpl10))));
- i += dpl10;
- }
- result.isNeg = isNeg;
- }
- return result;
- }
- function biCopy(bi)
- {
- var result = new BigInt(true);
- result.digits = bi.digits.slice(0);
- result.isNeg = bi.isNeg;
- return result;
- }
- function biFromNumber(i)
- {
- var result = new BigInt();
- result.isNeg = i < 0;
- i = Math.abs(i);
- var j = 0;
- while (i > 0) {
- result.digits[j++] = i & maxDigitVal;
- i >>= biRadixBits;
- }
- return result;
- }
- function reverseStr(s)
- {
- var result = "";
- for (var i = s.length - 1; i > -1; --i) {
- result += s.charAt(i);
- }
- return result;
- }
- var hexatrigesimalToChar = new Array(
- '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
- 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',
- 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
- 'u', 'v', 'w', 'x', 'y', 'z'
- );
- function biToString(x, radix)
- // 2 <= radix <= 36
- {
- var b = new BigInt();
- b.digits[0] = radix;
- var qr = biDivideModulo(x, b);
- var result = hexatrigesimalToChar[qr[1].digits[0]];
- while (biCompare(qr[0], bigZero) == 1) {
- qr = biDivideModulo(qr[0], b);
- digit = qr[1].digits[0];
- result += hexatrigesimalToChar[qr[1].digits[0]];
- }
- return (x.isNeg ? "-" : "") + reverseStr(result);
- }
- function biToDecimal(x)
- {
- var b = new BigInt();
- b.digits[0] = 10;
- var qr = biDivideModulo(x, b);
- var result = String(qr[1].digits[0]);
- while (biCompare(qr[0], bigZero) == 1) {
- qr = biDivideModulo(qr[0], b);
- result += String(qr[1].digits[0]);
- }
- return (x.isNeg ? "-" : "") + reverseStr(result);
- }
- var hexToChar = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
- 'a', 'b', 'c', 'd', 'e', 'f');
- function digitToHex(n)
- {
- var mask = 0xf;
- var result = "";
- for (i = 0; i < 4; ++i) {
- result += hexToChar[n & mask];
- n >>>= 4;
- }
- return reverseStr(result);
- }
- function biToHex(x)
- {
- var result = "";
- var n = biHighIndex(x);
- for (var i = biHighIndex(x); i > -1; --i) {
- result += digitToHex(x.digits[i]);
- }
- return result;
- }
- function charToHex(c)
- {
- var ZERO = 48;
- var NINE = ZERO + 9;
- var littleA = 97;
- var littleZ = littleA + 25;
- var bigA = 65;
- var bigZ = 65 + 25;
- var result;
- if (c >= ZERO && c <= NINE) {
- result = c - ZERO;
- } else if (c >= bigA && c <= bigZ) {
- result = 10 + c - bigA;
- } else if (c >= littleA && c <= littleZ) {
- result = 10 + c - littleA;
- } else {
- result = 0;
- }
- return result;
- }
- function hexToDigit(s)
- {
- var result = 0;
- var sl = Math.min(s.length, 4);
- for (var i = 0; i < sl; ++i) {
- result <<= 4;
- result |= charToHex(s.charCodeAt(i))
- }
- return result;
- }
- function biFromHex(s)
- {
- var result = new BigInt();
- var sl = s.length;
- for (var i = sl, j = 0; i > 0; i -= 4, ++j) {
- result.digits[j] = hexToDigit(s.substr(Math.max(i - 4, 0), Math.min(i, 4)));
- }
- return result;
- }
- function biFromString(s, radix)
- {
- var isNeg = s.charAt(0) == '-';
- var istop = isNeg ? 1 : 0;
- var result = new BigInt();
- var place = new BigInt();
- place.digits[0] = 1; // radix^0
- for (var i = s.length - 1; i >= istop; i--) {
- var c = s.charCodeAt(i);
- var digit = charToHex(c);
- var biDigit = biMultiplyDigit(place, digit);
- result = biAdd(result, biDigit);
- place = biMultiplyDigit(place, radix);
- }
- result.isNeg = isNeg;
- return result;
- }
- function biDump(b)
- {
- return (b.isNeg ? "-" : "") + b.digits.join(" ");
- }
- function biAdd(x, y)
- {
- var result;
- if (x.isNeg != y.isNeg) {
- y.isNeg = !y.isNeg;
- result = biSubtract(x, y);
- y.isNeg = !y.isNeg;
- }
- else {
- result = new BigInt();
- var c = 0;
- var n;
- for (var i = 0; i < x.digits.length; ++i) {
- n = x.digits[i] + y.digits[i] + c;
- result.digits[i] = n & 0xffff;
- c = Number(n >= biRadix);
- }
- result.isNeg = x.isNeg;
- }
- return result;
- }
- function biSubtract(x, y)
- {
- var result;
- if (x.isNeg != y.isNeg) {
- y.isNeg = !y.isNeg;
- result = biAdd(x, y);
- y.isNeg = !y.isNeg;
- } else {
- result = new BigInt();
- var n, c;
- c = 0;
- for (var i = 0; i < x.digits.length; ++i) {
- n = x.digits[i] - y.digits[i] + c;
- result.digits[i] = n & 0xffff;
- // Stupid non-conforming modulus operation.
- if (result.digits[i] < 0) result.digits[i] += biRadix;
- c = 0 - Number(n < 0);
- }
- // Fix up the negative sign, if any.
- if (c == -1) {
- c = 0;
- for (var i = 0; i < x.digits.length; ++i) {
- n = 0 - result.digits[i] + c;
- result.digits[i] = n & 0xffff;
- // Stupid non-conforming modulus operation.
- if (result.digits[i] < 0) result.digits[i] += biRadix;
- c = 0 - Number(n < 0);
- }
- // Result is opposite sign of arguments.
- result.isNeg = !x.isNeg;
- } else {
- // Result is same sign.
- result.isNeg = x.isNeg;
- }
- }
- return result;
- }
- function biHighIndex(x)
- {
- var result = x.digits.length - 1;
- while (result > 0 && x.digits[result] == 0) --result;
- return result;
- }
- function biNumBits(x)
- {
- var n = biHighIndex(x);
- var d = x.digits[n];
- var m = (n + 1) * bitsPerDigit;
- var result;
- for (result = m; result > m - bitsPerDigit; --result) {
- if ((d & 0x8000) != 0) break;
- d <<= 1;
- }
- return result;
- }
- function biMultiply(x, y)
- {
- var result = new BigInt();
- var c;
- var n = biHighIndex(x);
- var t = biHighIndex(y);
- var u, uv, k;
- for (var i = 0; i <= t; ++i) {
- c = 0;
- k = i;
- for (j = 0; j <= n; ++j, ++k) {
- uv = result.digits[k] + x.digits[j] * y.digits[i] + c;
- result.digits[k] = uv & maxDigitVal;
- c = uv >>> biRadixBits;
- }
- result.digits[i + n + 1] = c;
- }
- // Someone give me a logical xor, please.
- result.isNeg = x.isNeg != y.isNeg;
- return result;
- }
- function biMultiplyDigit(x, y)
- {
- var n, c, uv;
- result = new BigInt();
- n = biHighIndex(x);
- c = 0;
- for (var j = 0; j <= n; ++j) {
- uv = result.digits[j] + x.digits[j] * y + c;
- result.digits[j] = uv & maxDigitVal;
- c = uv >>> biRadixBits;
- }
- result.digits[1 + n] = c;
- return result;
- }
- function arrayCopy(src, srcStart, dest, destStart, n)
- {
- var m = Math.min(srcStart + n, src.length);
- for (var i = srcStart, j = destStart; i < m; ++i, ++j) {
- dest[j] = src[i];
- }
- }
- var highBitMasks = new Array(0x0000, 0x8000, 0xC000, 0xE000, 0xF000, 0xF800,
- 0xFC00, 0xFE00, 0xFF00, 0xFF80, 0xFFC0, 0xFFE0,
- 0xFFF0, 0xFFF8, 0xFFFC, 0xFFFE, 0xFFFF);
- function biShiftLeft(x, n)
- {
- var digitCount = Math.floor(n / bitsPerDigit);
- var result = new BigInt();
- arrayCopy(x.digits, 0, result.digits, digitCount,
- result.digits.length - digitCount);
- var bits = n % bitsPerDigit;
- var rightBits = bitsPerDigit - bits;
- for (var i = result.digits.length - 1, i1 = i - 1; i > 0; --i, --i1) {
- result.digits[i] = ((result.digits[i] << bits) & maxDigitVal) |
- ((result.digits[i1] & highBitMasks[bits]) >>>
- (rightBits));
- }
- result.digits[0] = ((result.digits[i] << bits) & maxDigitVal);
- result.isNeg = x.isNeg;
- return result;
- }
- var lowBitMasks = new Array(0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F,
- 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF,
- 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF);
- function biShiftRight(x, n)
- {
- var digitCount = Math.floor(n / bitsPerDigit);
- var result = new BigInt();
- arrayCopy(x.digits, digitCount, result.digits, 0,
- x.digits.length - digitCount);
- var bits = n % bitsPerDigit;
- var leftBits = bitsPerDigit - bits;
- for (var i = 0, i1 = i + 1; i < result.digits.length - 1; ++i, ++i1) {
- result.digits[i] = (result.digits[i] >>> bits) |
- ((result.digits[i1] & lowBitMasks[bits]) << leftBits);
- }
- result.digits[result.digits.length - 1] >>>= bits;
- result.isNeg = x.isNeg;
- return result;
- }
- function biMultiplyByRadixPower(x, n)
- {
- var result = new BigInt();
- arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);
- return result;
- }
- function biDivideByRadixPower(x, n)
- {
- var result = new BigInt();
- arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);
- return result;
- }
- function biModuloByRadixPower(x, n)
- {
- var result = new BigInt();
- arrayCopy(x.digits, 0, result.digits, 0, n);
- return result;
- }
- function biCompare(x, y)
- {
- if (x.isNeg != y.isNeg) {
- return 1 - 2 * Number(x.isNeg);
- }
- for (var i = x.digits.length - 1; i >= 0; --i) {
- if (x.digits[i] != y.digits[i]) {
- if (x.isNeg) {
- return 1 - 2 * Number(x.digits[i] > y.digits[i]);
- } else {
- return 1 - 2 * Number(x.digits[i] < y.digits[i]);
- }
- }
- }
- return 0;
- }
- function biDivideModulo(x, y)
- {
- var nb = biNumBits(x);
- var tb = biNumBits(y);
- var origYIsNeg = y.isNeg;
- var q, r;
- if (nb < tb) {
- // |x| < |y|
- if (x.isNeg) {
- q = biCopy(bigOne);
- q.isNeg = !y.isNeg;
- x.isNeg = false;
- y.isNeg = false;
- r = biSubtract(y, x);
- // Restore signs, 'cause they're references.
- x.isNeg = true;
- y.isNeg = origYIsNeg;
- } else {
- q = new BigInt();
- r = biCopy(x);
- }
- return new Array(q, r);
- }
- q = new BigInt();
- r = x;
- // Normalize Y.
- var t = Math.ceil(tb / bitsPerDigit) - 1;
- var lambda = 0;
- while (y.digits[t] < biHalfRadix) {
- y = biShiftLeft(y, 1);
- ++lambda;
- ++tb;
- t = Math.ceil(tb / bitsPerDigit) - 1;
- }
- // Shift r over to keep the quotient constant. We'll shift the
- // remainder back at the end.
- r = biShiftLeft(r, lambda);
- nb += lambda; // Update the bit count for x.
- var n = Math.ceil(nb / bitsPerDigit) - 1;
- var b = biMultiplyByRadixPower(y, n - t);
- while (biCompare(r, b) != -1) {
- ++q.digits[n - t];
- r = biSubtract(r, b);
- }
- for (var i = n; i > t; --i) {
- var ri = (i >= r.digits.length) ? 0 : r.digits[i];
- var ri1 = (i - 1 >= r.digits.length) ? 0 : r.digits[i - 1];
- var ri2 = (i - 2 >= r.digits.length) ? 0 : r.digits[i - 2];
- var yt = (t >= y.digits.length) ? 0 : y.digits[t];
- var yt1 = (t - 1 >= y.digits.length) ? 0 : y.digits[t - 1];
- if (ri == yt) {
- q.digits[i - t - 1] = maxDigitVal;
- } else {
- q.digits[i - t - 1] = Math.floor((ri * biRadix + ri1) / yt);
- }
- var c1 = q.digits[i - t - 1] * ((yt * biRadix) + yt1);
- var c2 = (ri * biRadixSquared) + ((ri1 * biRadix) + ri2);
- while (c1 > c2) {
- --q.digits[i - t - 1];
- c1 = q.digits[i - t - 1] * ((yt * biRadix) | yt1);
- c2 = (ri * biRadix * biRadix) + ((ri1 * biRadix) + ri2);
- }
- b = biMultiplyByRadixPower(y, i - t - 1);
- r = biSubtract(r, biMultiplyDigit(b, q.digits[i - t - 1]));
- if (r.isNeg) {
- r = biAdd(r, b);
- --q.digits[i - t - 1];
- }
- }
- r = biShiftRight(r, lambda);
- // Fiddle with the signs and stuff to make sure that 0 <= r < y.
- q.isNeg = x.isNeg != origYIsNeg;
- if (x.isNeg) {
- if (origYIsNeg) {
- q = biAdd(q, bigOne);
- } else {
- q = biSubtract(q, bigOne);
- }
- y = biShiftRight(y, lambda);
- r = biSubtract(y, r);
- }
- // Check for the unbelievably stupid degenerate case of r == -0.
- if (r.digits[0] == 0 && biHighIndex(r) == 0) r.isNeg = false;
- return new Array(q, r);
- }
- function biDivide(x, y)
- {
- return biDivideModulo(x, y)[0];
- }
- function biModulo(x, y)
- {
- return biDivideModulo(x, y)[1];
- }
- function biMultiplyMod(x, y, m)
- {
- return biModulo(biMultiply(x, y), m);
- }
- function biPow(x, y)
- {
- var result = bigOne;
- var a = x;
- while (true) {
- if ((y & 1) != 0) result = biMultiply(result, a);
- y >>= 1;
- if (y == 0) break;
- a = biMultiply(a, a);
- }
- return result;
- }
- function biPowMod(x, y, m)
- {
- var result = bigOne;
- var a = x;
- var k = y;
- while (true) {
- if ((k.digits[0] & 1) != 0) result = biMultiplyMod(result, a, m);
- k = biShiftRight(k, 1);
- if (k.digits[0] == 0 && biHighIndex(k) == 0) break;
- a = biMultiplyMod(a, a, m);
- }
- return result;
- }
- function biFromRaw(s)
- {
- var result = new BigInt();
- var sl = s.length;
- for (var i = 0, j = 0; i < sl; i += 2, ++j) {
- result.digits[j] = s.charCodeAt(i)+((i<sl-1)?(s.charCodeAt(i+1)*256):0);
- }
- return result;
- }
- function biToRaw(x)
- {
- var result = "";
- var n = biHighIndex(x);
- for (i=n; i > -1; --i) {
- result += String.fromCharCode(x.digits[i]/256, x.digits[i] % 256);
- }
- return reverseStr(result);
- }
- // BarrettMu, a class for performing Barrett modular reduction computations in
- // JavaScript.
- //
- // Requires BigInt.js.
- //
- // Copyright 2004-2005 David Shapiro.
- //
- // You may use, re-use, abuse, copy, and modify this code to your liking, but
- // please keep this header.
- //
- // Thanks!
- //
- // Dave Shapiro
- // dave@ohdave.com
- function BarrettMu(m)
- {
- this.modulus = biCopy(m);
- this.k = biHighIndex(this.modulus) + 1;
- var b2k = new BigInt();
- b2k.digits[2 * this.k] = 1; // b2k = b^(2k)
- this.mu = biDivide(b2k, this.modulus);
- this.bkplus1 = new BigInt();
- this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)
- this.modulo = BarrettMu_modulo;
- this.multiplyMod = BarrettMu_multiplyMod;
- this.powMod = BarrettMu_powMod;
- }
- function BarrettMu_modulo(x)
- {
- var q1 = biDivideByRadixPower(x, this.k - 1);
- var q2 = biMultiply(q1, this.mu);
- var q3 = biDivideByRadixPower(q2, this.k + 1);
- var r1 = biModuloByRadixPower(x, this.k + 1);
- var r2term = biMultiply(q3, this.modulus);
- var r2 = biModuloByRadixPower(r2term, this.k + 1);
- var r = biSubtract(r1, r2);
- if (r.isNeg) {
- r = biAdd(r, this.bkplus1);
- }
- var rgtem = biCompare(r, this.modulus) >= 0;
- while (rgtem) {
- r = biSubtract(r, this.modulus);
- rgtem = biCompare(r, this.modulus) >= 0;
- }
- return r;
- }
- function BarrettMu_multiplyMod(x, y)
- {
- /*
- x = this.modulo(x);
- y = this.modulo(y);
- */
- var xy = biMultiply(x, y);
- return this.modulo(xy);
- }
- function BarrettMu_powMod(x, y)
- {
- var result = new BigInt();
- result.digits[0] = 1;
- var a = x;
- var k = y;
- while (true) {
- if ((k.digits[0] & 1) != 0) result = this.multiplyMod(result, a);
- k = biShiftRight(k, 1);
- if (k.digits[0] == 0 && biHighIndex(k) == 0) break;
- a = this.multiplyMod(a, a);
- }
- return result;
- }
- // RSA, a suite of routines for performing RSA public-key computations in
- // JavaScript.
- //
- // Requires BigInt.js and Barrett.js.
- //
- // Copyright 1998-2005 David Shapiro.
- //
- // You may use, re-use, abuse, copy, and modify this code to your liking, but
- // please keep this header.
- //
- // Thanks!
- //
- // Dave Shapiro
- // dave@ohdave.com
- // http://www.ohdave.com/rsa/
- function rsasec_key(E, M, chunk)
- {
- setMaxDigits(160);
- this.e = biFromRaw(decode64(E));
- this.m = biFromRaw(decode64(M));
- this.chunkSize = parseInt(chunk);
- this.radix = 16;
- this.barrett = new BarrettMu(this.m);
- }
- function rsasec_crypt(s, key)
- {
- var a = new Array();
- var sl = s.length;
- var i = 0;
- while (i < sl) {
- a[i] = s.charCodeAt(i);
- i++;
- }
- while (a.length % key.chunkSize != 0)
- {
- a[i++] = 0;
- }
- var al = a.length;
- var result = "";
- var j, k, block;
- for (i = 0; i < al; i += key.chunkSize)
- {
- block = new BigInt();
- j = 0;
- for (k = i; k < i + key.chunkSize; ++j)
- {
- block.digits[j] = a[k++];
- block.digits[j] += a[k++] << 8;
- }
- var crypt = key.barrett.powMod(block, key.e);
- var text = encode64(biToRaw(crypt));
- result += text + " ";
- }
- return result.substring(0, result.length - 1); // Remove last space.
- }
- //
- // Form manipulation
- //
- function rsasec_form_bind(arData)
- {
- BX.ready(function()
- {
- var form = document.forms[arData.formid];
- if(!form)
- form = document.getElementById(arData.formid);
- if(form)
- {
- BX.bind(form, "submit", function()
- {
- rsasec_form(arData);
- return true;
- });
- }
- });
- }
- function rsasec_form(arData)
- {
- var form = document.forms[arData.formid];
- if(!form)
- form = document.getElementById(arData.formid);
- if(form)
- {
- var key = new rsasec_key(arData.key.E, arData.key.M, arData.key.chunk);
- var data = '__RSA_RAND=' + arData.rsa_rand;
- for(var i = 0; i < arData.params.length; i++)
- {
- var el = form.elements[arData.params[i]];
- if(el)
- {
- data += '&' + arData.params[i] + '=' + encodeURIComponent(el.value);
- el.disabled = true;
- }
- }
- data = data + '&__SHA=' + SHA1(data);
- var inp = document.createElement('INPUT');
- inp.type = 'hidden';
- inp.name = '__RSA_DATA';
- inp.value = rsasec_crypt(data, key);
- form.appendChild(inp);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement