JS代码 浏览器运行可以，系统运行出错

朱辉

就是这一段  系统运行就出错 ！！ 就是为啥了。。。请问下小哥哥，小姐姐们

  

function BarrettMu (i)
{
this.modulus = biCopy (i), this.k = biHighIndex (this.modulus) + 1;
var t = new BigInt;
t.digits[2 * this.k] = 1, this.mu = biDivide (t, this.modulus), this.bkplus1 = new BigInt, this.bkplus1.digits[this.k + 1] = 1,
this.modulo = BarrettMu_modulo, this.multiplyMod = BarrettMu_multiplyMod, this.powMod = BarrettMu_powMod
}
function BarrettMu_modulo (i)
{
var t = biDivideByRadixPower (i, this.k - 1) , r = biMultiply (t, this.mu) , e = biDivideByRadixPower (r,
this.k + 1) , n = biModuloByRadixPower (i, this.k + 1) , g = biMultiply (e, this.modulus) , s = biModuloByRadixPower (g,
this.k + 1) , d = biSubtract (n, s);
d.isNeg && (d = biAdd (d, this.bkplus1));
for (var o = biCompare (d, this.modulus) >= 0; o; ) {
d = biSubtract (d, this.modulus), o = biCompare (d, this.modulus) >= 0;
}
return d
}
function BarrettMu_multiplyMod (i, t)
{
var r = biMultiply (i, t);
return this.modulo (r)
}
function BarrettMu_powMod (i, t)
{
var r = new BigInt;
r.digits[0] = 1;
for (var e = i, n = t; ; )
{
if (0 != (1 & n.digits[0]) && (r = this.multiplyMod (r, e)), n = biShiftRight (n, 1), 0 == n.digits[0] && 0 == biHighIndex (n)) {
break;
}
e = this.multiplyMod (e, e)
}
return r
}
function setMaxDigits (i)
{
maxDigits = i, ZERO_ARRAY = new Array (maxDigits);
for (var t = 0; t < ZERO_ARRAY.length; t++) {
ZERO_ARRAY[t] = 0;
}
bigZero = new BigInt, bigOne = new BigInt, bigOne.digits[0] = 1
}
function BigInt (i)
{
"boolean" == typeof i && 1 == i ? this.digits = null : this.digits = ZERO_ARRAY.slice (0), this.isNeg = !1
}
function biFromDecimal (i)
{
for (var t, r = "-" == i.charAt (0), e = r ? 1 : 0; e < i.length && "0" == i.charAt (e); ) {
++e;
}
if (e == i.length) {
t = new BigInt;
}
else
{
var n = i.length - e , g = n % dpl10;
for (0 == g && (g = dpl10), t = biFromNumber (Number (i.substr (e, g))), e += g; e < i.length; ) {
t = biAdd (biMultiply (t, lr10), biFromNumber (Number (i.substr (e, dpl10)))), e += dpl10;
}
t.isNeg = r
}
return t
}
function biCopy (i)
{
var t = new BigInt ( (!0));
return t.digits = i.digits.slice (0), t.isNeg = i.isNeg, t
}
function biFromNumber (i)
{
var t = new BigInt;
t.isNeg = i < 0, i = Math.abs (i);
for (var r = 0; i > 0; ) {
t.digits[r++] = i & maxDigitVal, i >>= biRadixBits;
}
return t
}
function reverseStr (i)
{
for (var t = "", r = i.length - 1; r > - 1; --r) {
t += i.charAt (r);
}
return t
}
function biToString (i, t)
{
var r = new BigInt;
r.digits[0] = t;
for (var e = biDivideModulo (i, r), n = hexatrigesimalToChar[e[1].digits[0]]; 1 == biCompare (e[0],
bigZero);
) e = biDivideModulo (e[0], r), digit = e[1].digits[0], n += hexatrigesimalToChar[e[1].digits[0]];
return (i.isNeg ? "-" : "") + reverseStr (n)
}
function biToDecimal (i)
{
var t = new BigInt;
t.digits[0] = 10;
for (var r = biDivideModulo (i, t), e = String (r[1].digits[0]); 1 == biCompare (r[0], bigZero); ) {
r = biDivideModulo (r[0], t), e += String (r[1].digits[0]);
}
return (i.isNeg ? "-" : "") + reverseStr (e)
}
function digitToHex (t)
{
var r = 15 , e = "";
for (i = 0; i < 4; ++i) {
e += hexToChar[t & r], t >>>= 4;
}
return reverseStr (e)
}
function biToHex (i)
{
for (var t = "", r = (biHighIndex (i), biHighIndex (i)); r > - 1; --r) {
t += digitToHex (i.digits[r]);
}
return t
}
function charToHex (i)
{
var t, r = 48, e = r + 9, n = 97, g = n + 25, s = 65, d = 90;
return t = i >= r && i <= e ? i - r : i >= s && i <= d ? 10 + i - s : i >= n && i <= g ? 10 + i - n : 0
}
function hexToDigit (i)
{
for (var t = 0, r = Math.min (i.length, 4), e = 0; e < r; ++e) {
t <<= 4, t |= charToHex (i.charCodeAt (e));
}
return t
}
function biFromHex (i)
{
for (var t = new BigInt, r = i.length, e = r, n = 0; e > 0; e -= 4, ++n) {
t.digits[n] = hexToDigit (i.substr (Math.max (e - 4, 0), Math.min (e, 4)));
}
return t
}
function biFromString (i, t)
{
var r = "-" == i.charAt (0) , e = r ? 1 : 0 , n = new BigInt , g = new BigInt;
g.digits[0] = 1;
for (var s = i.length - 1; s >= e; s--)
{
var d = i.charCodeAt (s) , o = charToHex (d) , a = biMultiplyDigit (g, o);
n = biAdd (n, a), g = biMultiplyDigit (g, t)
}
return n.isNeg = r, n
}
function biToBytes (i)
{
for (var t = "", r = biHighIndex (i); r > - 1; --r) {
t += digitToBytes (i.digits[r]);
}
return t
}
function digitToBytes (i)
{
var t = String.fromCharCode (255 & i);
i >>>= 8;
var r = String.fromCharCode (255 & i);
return r + t
}
function biDump (i)
{
return (i.isNeg ? "-" : "") + i.digits.join (" ")
}
function biAdd (i, t)
{
var r;
if (i.isNeg != t.isNeg) {
t.isNeg = !t.isNeg, r = biSubtract (i, t), t.isNeg = !t.isNeg;
}
else
{
r = new BigInt;
for (var e, n = 0, g = 0; g < i.digits.length; ++g) {
e = i.digits[g] + t.digits[g] + n, r.digits[g] = 65535 & e, n = Number (e >= biRadix);
}
r.isNeg = i.isNeg
}
return r
}
function biSubtract (i, t)
{
var r;
if (i.isNeg != t.isNeg) {
t.isNeg = !t.isNeg, r = biAdd (i, t), t.isNeg = !t.isNeg;
}
else
{
r = new BigInt;
var e, n;
n = 0;
for (var g = 0; g < i.digits.length; ++g)
{
e = i.digits[g] - t.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix),
n = 0 - Number (e < 0);
}
if (n == - 1)
{
n = 0;
for (var g = 0; g < i.digits.length; ++g)
{
e = 0 - r.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix),
n = 0 - Number (e < 0);
}
r.isNeg = !i.isNeg
}
else {
r.isNeg = i.isNeg ;
}
}
return r
}
function biHighIndex (i)
{
for (var t = i.digits.length - 1; t > 0 && 0 == i.digits[t]; ) {
--t;
}
return t
}
function biNumBits (i)
{
var t, r = biHighIndex (i), e = i.digits[r], n = (r + 1) * bitsPerDigit;
for (t = n; t > n - bitsPerDigit && 0 == (32768 & e); --t) {
e <<= 1;
}
return t
}
function biMultiply (i, t)
{
for (var r, e, n, g = new BigInt, s = biHighIndex (i), d = biHighIndex (t), o = 0; o <= d; ++o)
{
for (r = 0, n = o, j = 0; j <= s; ++j, ++n)
{
e = g.digits[n] + i.digits[j] * t.digits[o] + r, g.digits[n] = e & maxDigitVal, r = e >>> biRadixBits;
}
g.digits[o + s + 1] = r
}
return g.isNeg = i.isNeg != t.isNeg, g
}
function biMultiplyDigit (i, t)
{
var r, e, n;
result = new BigInt, r = biHighIndex (i), e = 0;
for (var g = 0; g <= r; ++g)
{
n = result.digits[g] + i.digits[g] * t + e, result.digits[g] = n & maxDigitVal, e = n >>> biRadixBits;
}
return result.digits[1 + r] = e, result
}
function arrayCopy (i, t, r, e, n)
{
for (var g = Math.min (t + n, i.length), s = t, d = e; s < g; ++s, ++d) {
r[d] = i[s];
}
}
function biShiftLeft (i, t)
{
var r = Math.floor (t  / bitsPerDigit) , e = new BigInt;
arrayCopy (i.digits, 0, e.digits, r, e.digits.length - r);
for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = e.digits.length - 1, d = s - 1; s > 0; --s,
--d) e.digits[s] = e.digits[s] << n & maxDigitVal | (e.digits[d] & highBitMasks[n]) >>> g;
return e.digits[0] = e.digits[s] << n & maxDigitVal, e.isNeg = i.isNeg, e
}
function biShiftRight (i, t)
{
var r = Math.floor (t  / bitsPerDigit) , e = new BigInt;
arrayCopy (i.digits, r, e.digits, 0, i.digits.length - r);
for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = 0, d = s + 1; s < e.digits.length - 1; ++s,
++d) e.digits[s] = e.digits[s] >>> n | (e.digits[d] & lowBitMasks[n]) << g;
return e.digits[e.digits.length - 1] >>>= n, e.isNeg = i.isNeg, e
}
function biMultiplyByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, 0, r.digits, t, r.digits.length - t), r
}
function biDivideByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, t, r.digits, 0, r.digits.length - t), r
}
function biModuloByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, 0, r.digits, 0, t), r
}
function biCompare (i, t)
{
if (i.isNeg != t.isNeg) {
return 1 - 2 * Number (i.isNeg);
}
for (var r = i.digits.length - 1; r >= 0; --r)
{
if (i.digits[r] != t.digits[r])
{
return i.isNeg ? 1 - 2 * Number (i.digits[r] > t.digits[r]) : 1 - 2 * Number (i.digits[r] < t.digits[r]);
}
return 0;
}
}
function biDivideModulo (i, t)
{
var r, e, n = biNumBits (i), g = biNumBits (t), s = t.isNeg;
if (n < g)
{
return i.isNeg ? (r = biCopy (bigOne), r.isNeg = !t.isNeg, i.isNeg = !1, t.isNeg = !1, e = biSubtract (t,
i), i.isNeg = !0, t.isNeg = s) : (r = new BigInt, e = biCopy (i)), new Array (r, e);
}
r = new BigInt, e = i;
for (var d = Math.ceil (g  / bitsPerDigit) - 1, o = 0; t.digits[d] < biHalfRadix; ) {
t = biShiftLeft (t, 1), ++o, ++g, d = Math.ceil (g  / bitsPerDigit) - 1;
}
e = biShiftLeft (e, o), n += o;
for (var a = Math.ceil (n  / bitsPerDigit) - 1, u = biMultiplyByRadixPower (t, a - d); biCompare (e,
u) != - 1;
) ++r.digits[a - d], e = biSubtract (e, u);
for (var b = a; b > d; --b)
{
var l = b >= e.digits.length ? 0 : e.digits[b] , h = b - 1 >= e.digits.length ? 0 : e.digits[b - 1] ,
f = b - 2 >= e.digits.length ? 0 : e.digits[b - 2] , c = d >= t.digits.length ? 0 : t.digits[d] ,
m = d - 1 >= t.digits.length ? 0 : t.digits[d - 1];
l == c ? r.digits[b - d - 1] = maxDigitVal : r.digits[b - d - 1] = Math.floor ( (l * biRadix + h)  / c);
for (var x = r.digits[b - d - 1] * (c * biRadix + m), v = l * biRadixSquared + (h * biRadix + f); x > v; )
{
--r.digits[b - d - 1], x = r.digits[b - d - 1] * (c * biRadix | m), v = l * biRadix * biRadix + (h * biRadix + f);
}
u = biMultiplyByRadixPower (t, b - d - 1), e = biSubtract (e, biMultiplyDigit (u, r.digits[b - d - 1])),
e.isNeg && (e = biAdd (e, u), --r.digits[b - d - 1])
}
return e = biShiftRight (e, o), r.isNeg = i.isNeg != s, i.isNeg && (r = s ? biAdd (r, bigOne) : biSubtract (r,
bigOne), t = biShiftRight (t, o), e = biSubtract (t, e)), 0 == e.digits[0] && 0 == biHighIndex (e) && (e.isNeg = !1),
new Array (r, e)
}
function biDivide (i, t)
{
return biDivideModulo (i, t)[0]
}
function biModulo (i, t)
{
return biDivideModulo (i, t)[1]
}
function biMultiplyMod (i, t, r)
{
return biModulo (biMultiply (i, t), r)
}
function biPow (i, t)
{
for (var r = bigOne, e = i; ; ) {
if (0 != (1 & t) && (r = biMultiply (r, e)), t >>= 1, 0 == t) {
break;
}
e = biMultiply (e, e)
}
return r
}
function biPowMod (i, t, r)
{
for (var e = bigOne, n = i, g = t; ; )
{
if (0 != (1 & g.digits[0]) && (e = biMultiplyMod (e, n, r)), g = biShiftRight (g, 1), 0 == g.digits[0] && 0 == biHighIndex (g)) {
break;
}
n = biMultiplyMod (n, n, r)
}
return e
}
function RSAKeyPair (i, t, r, e)
{
this.e = biFromHex (i), this.d = biFromHex (t), this.m = biFromHex (r), "number" != typeof e ? this.chunkSize = 2 * biHighIndex (this.m) : this.chunkSize = e  / 8,
this.radix = 16, this.barrett = new BarrettMu (this.m)
}
function encryptedString (i, t, r, e)
{
var n, g, s, d, o, a, u, b, l, h, f = new Array, c = t.length, m = "";
for (d = "string" == typeof r ? r == RSAAPP.NoPadding ? 1 : r == RSAAPP.PKCS1Padding ? 2 : 0 : 0,
o = "string" == typeof e && e == RSAAPP.RawEncoding ? 1 : 0, 1 == d ? c > i.chunkSize && (c = i.chunkSize) : 2 == d && c > i.chunkSize - 11 && (c = i.chunkSize - 11),
n = 0, g = 2 == d ? c - 1 : i.chunkSize - 1;
n < c;
) d ? f[g] = t.charCodeAt (n) : f[n] = t.charCodeAt (n), n++, g--;
for (1 == d && (n = 0), g = i.chunkSize - c % i.chunkSize; g > 0; )
{
if (2 == d) {
for (a = Math.floor (256 * Math.random ()); !a; ) {
a = Math.floor (256 * Math.random ());
}
f[n] = a
}
else {
f[n] = 0;
}
n++, g--
}
for (2 == d && (f[c] = 0, f[i.chunkSize - 2] = 2, f[i.chunkSize - 1] = 0), u = f.length, n = 0; n < u; n += i.chunkSize)
{
for (b = new BigInt, g = 0, s = n; s < n + i.chunkSize; ++g) {
b.digits[g] = f[s++], b.digits[g] += f[s++] << 8;
}
l = i.barrett.powMod (b, i.e), h = 1 == o ? biToBytes (l) : 16 == i.radix ? biToHex (l) : biToString (l,
i.radix), m += h
}
return m
}
function decryptedString (i, t)
{
var r, e, n, g, s = t.split (" "), d = "";
for (e = 0; e < s.length; ++e)
{
for (g = 16 == i.radix ? biFromHex (s[e]) : biFromString (s[e], i.radix), r = i.barrett.powMod (g,
i.d), n = 0;
n <= biHighIndex (r);
++n) d += String.fromCharCode (255 & r.digits[n], r.digits[n] >> 8);
}
return 0 == d.charCodeAt (d.length - 1) && (d = d.substring (0, d.length - 1)), d
}
var biRadixBase = 2, biRadixBits = 16, bitsPerDigit = biRadixBits, biRadix = 65536, biHalfRadix = biRadix >>> 1,
biRadixSquared = biRadix * biRadix, maxDigitVal = biRadix - 1, maxInteger = 9999999999999998, maxDigits,
ZERO_ARRAY, bigZero, bigOne;
setMaxDigits (20);
var dpl10 = 15 , lr10 = biFromNumber (1e15) , 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") , hexToChar = new Array ("0", "1", "2", "3", "4", "5",
"6", "7", "8", "9", "a", "b", "c", "d", "e", "f") , highBitMasks = new Array (0, 32768, 49152, 57344, 61440,
63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535) , lowBitMasks = new Array (0,
1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535) , RSAAPP = {};
RSAAPP.NoPadding = "NoPadding", RSAAPP.PKCS1Padding = "PKCS1Padding", RSAAPP.RawEncoding = "RawEncoding",
RSAAPP.NumericEncoding = "NumericEncoding";
var Base64 =
{
enKey : ' ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/', deKey : new Array( - 1,
- 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, 62, - 1, - 1, - 1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, - 1, - 1, - 1, - 1, - 1, - 1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 49, 50, 51, - 1, - 1, - 1, - 1, - 1),
encode : function (src)
{
var str = new Array ();
var ch1, ch2, ch3;
var pos = 0;
while (pos + 3 <= src.length)
{
ch1 = src.charCodeAt (pos++);
ch2 = src.charCodeAt (pos++);
ch3 = src.charCodeAt (pos++);
str.push (this.enKey.charAt (ch1 >> 2), this.enKey.charAt ( ( (ch1 << 4) + (ch2 >> 4)) & 0x3f));
str.push (this.enKey.charAt ( ( (ch2 << 2) + (ch3 >> 6)) & 0x3f), this.enKey.charAt (ch3 & 0x3f));
}
if (pos < src.length)
{
ch1 = src.charCodeAt (pos++);
str.push (this.enKey.charAt (ch1 >> 2));
if (pos < src.length)
{
ch2 = src.charCodeAt (pos);
str.push (this.enKey.charAt ( ( (ch1 << 4) + (ch2 >> 4)) & 0x3f));
str.push (this.enKey.charAt (ch2 << 2 & 0x3f), ' =');
}
else {
str.push (this.enKey.charAt (ch1 << 4 & 0x3f), ' ==');
}
}
return str.join ( ' ');
},
decode : function (src)
{
var str = new Array ();
var ch1, ch2, ch3, ch4;
var pos = 0;
src = src.replace (/[^A-Za-z0-9\+\/]/g, ' ');
while (pos + 4 <= src.length)
{
ch1 = this.deKey[src.charCodeAt (pos++)];
ch2 = this.deKey[src.charCodeAt (pos++)];
ch3 = this.deKey[src.charCodeAt (pos++)];
ch4 = this.deKey[src.charCodeAt (pos++)];
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2),
(ch3 << 6 & 0xff) + ch4));
}
if (pos + 1 < src.length)
{
ch1 = this.deKey[src.charCodeAt (pos++)];
ch2 = this.deKey[src.charCodeAt (pos++)];
if (pos < src.length)
{
ch3 = this.deKey[src.charCodeAt (pos)];
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2)));
}
else {
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4)));
}
}
return str.join ( ' ');
}
};
//Base64.encode (pass);
function test (c, pwd)
{
setMaxDigits (131);
c = new RSAKeyPair ("3", "10001", c, 1024);
return Base64.encode (encryptedString (c, pwd, RSAAPP.PKCS1Padding, RSAAPP.RawEncoding));
}

function BarrettMu(i) <br /> {<br />     this.modulus = biCopy(i), this.k = biHighIndex(this.modulus) + 1;<br />     var t = new BigInt;<br />     t.digits[2 * this.k] = 1, this.mu = biDivide(t, this.modulus), this.bkplus1 = new BigInt, this.bkplus1.digits[this.k + 1] = 1, <br />     this.modulo = BarrettMu_modulo, this.multiplyMod = BarrettMu_multiplyMod, this.powMod = BarrettMu_powMod<br /> }<br /> function BarrettMu_modulo(i) <br /> {<br />     var t = biDivideByRadixPower(i, this.k - 1) , r = biMultiply(t, this.mu) , e = biDivideByRadixPower(r, <br />     this.k + 1) , n = biModuloByRadixPower(i, this.k + 1) , g = biMultiply(e, this.modulus) , s = biModuloByRadixPower(g, <br />     this.k + 1) , d = biSubtract(n, s);<br />     d.isNeg && (d = biAdd(d, this.bkplus1));<br />     for (var o = biCompare(d, this.modulus) >= 0; o; ) {<br />         d = biSubtract(d, this.modulus), o = biCompare(d, this.modulus) >= 0;<br />     }<br />     return d<br /> }<br /> function BarrettMu_multiplyMod(i, t) <br /> {<br />     var r = biMultiply(i, t);<br />     return this.modulo(r)<br /> }<br /> function BarrettMu_powMod(i, t) <br /> {<br />     var r = new BigInt;<br />     r.digits[0] = 1;<br />     for (var e = i, n = t; ; ) <br />     {<br />         if (0 != (1 & n.digits[0]) && (r = this.multiplyMod(r, e)), n = biShiftRight(n, 1), 0 == n.digits[0] && 0 == biHighIndex(n)) {<br />             break;<br />         }<br />         e = this.multiplyMod(e, e) <br />     }<br />     return r<br /> }<br /> function setMaxDigits(i) <br /> {<br />     maxDigits = i, ZERO_ARRAY = new Array(maxDigits);<br />     for (var t = 0; t < ZERO_ARRAY.length; t++) {<br />         ZERO_ARRAY[t] = 0;<br />     }<br />     bigZero = new BigInt, bigOne = new BigInt, bigOne.digits[0] = 1<br /> }<br /> function BigInt(i) <br /> {<br />     "boolean" == typeof i && 1 == i ? this.digits = null : this.digits = ZERO_ARRAY.slice(0), this.isNeg = !1<br /> }<br /> function biFromDecimal(i) <br /> {<br />     for (var t, r = "-" == i.charAt(0), e = r ? 1 : 0; e < i.length && "0" == i.charAt(e); ) {<br />         ++e;<br />     }<br />     if (e == i.length) {<br />         t = new BigInt;<br />     }<br />     else <br />     {<br />         var n = i.length - e , g = n % dpl10;<br />         for (0 == g && (g = dpl10), t = biFromNumber(Number(i.substr(e, g))), e += g; e < i.length; ) {<br />             t = biAdd(biMultiply(t, lr10), biFromNumber(Number(i.substr(e, dpl10)))), e += dpl10;<br />         }<br />         t.isNeg = r <br />     }<br />     return t<br /> }<br /> function biCopy(i) <br /> {<br />     var t = new BigInt((!0));<br />     return t.digits = i.digits.slice(0), t.isNeg = i.isNeg, t<br /> }<br /> function biFromNumber(i) <br /> {<br />     var t = new BigInt;<br />     t.isNeg = i < 0, i = Math.abs(i);<br />     for (var r = 0; i > 0; ) {<br />         t.digits[r++] = i & maxDigitVal, i >>= biRadixBits;<br />     }<br />     return t<br /> }<br /> function reverseStr(i) <br /> {<br />     for (var t = "", r = i.length - 1; r > - 1; --r) {<br />         t += i.charAt(r);<br />     }<br />     return t<br /> }<br /> function biToString(i, t) <br /> {<br />     var r = new BigInt;<br />     r.digits[0] = t;<br />     for (var e = biDivideModulo(i, r), n = hexatrigesimalToChar[e[1].digits[0]]; 1 == biCompare(e[0], <br />     bigZero);<br />     ) e = biDivideModulo(e[0], r), digit = e[1].digits[0], n += hexatrigesimalToChar[e[1].digits[0]];<br />     return (i.isNeg ? "-" : "") + reverseStr(n)<br /> }<br /> function biToDecimal(i) <br /> {<br />     var t = new BigInt;<br />     t.digits[0] = 10;<br />     for (var r = biDivideModulo(i, t), e = String(r[1].digits[0]); 1 == biCompare(r[0], bigZero); ) {<br />         r = biDivideModulo(r[0], t), e += String(r[1].digits[0]);<br />     }<br />     return (i.isNeg ? "-" : "") + reverseStr(e)<br /> }<br /> function digitToHex(t) <br /> {<br />     var r = 15 , e = "";<br />     for (i = 0; i < 4; ++i) {<br />         e += hexToChar[t & r], t >>>= 4;<br />     }<br />     return reverseStr(e)<br /> }<br /> function biToHex(i) <br /> {<br />     for (var t = "", r = (biHighIndex(i), biHighIndex(i)); r > - 1; --r) {<br />         t += digitToHex(i.digits[r]);<br />     }<br />     return t<br /> }<br /> function charToHex(i) <br /> {<br />     var t, r = 48, e = r + 9, n = 97, g = n + 25, s = 65, d = 90;<br />     return t = i >= r && i <= e ? i - r : i >= s && i <= d ? 10 + i - s : i >= n && i <= g ? 10 + i - n : 0<br /> }<br /> function hexToDigit(i) <br /> {<br />     for (var t = 0, r = Math.min(i.length, 4), e = 0; e < r; ++e) {<br />         t <<= 4, t |= charToHex(i.charCodeAt(e));<br />     }<br />     return t<br /> }<br /> function biFromHex(i) <br /> {<br />     for (var t = new BigInt, r = i.length, e = r, n = 0; e > 0; e -= 4, ++n) {<br />         t.digits[n] = hexToDigit(i.substr(Math.max(e - 4, 0), Math.min(e, 4)));<br />     }<br />     return t<br /> }<br /> function biFromString(i, t) <br /> {<br />     var r = "-" == i.charAt(0) , e = r ? 1 : 0 , n = new BigInt , g = new BigInt;<br />     g.digits[0] = 1;<br />     for (var s = i.length - 1; s >= e; s--) <br />     {<br />         var d = i.charCodeAt(s) , o = charToHex(d) , a = biMultiplyDigit(g, o);<br />         n = biAdd(n, a), g = biMultiplyDigit(g, t) <br />     }<br />     return n.isNeg = r, n<br /> }<br /> function biToBytes(i) <br /> {<br />     for (var t = "", r = biHighIndex(i); r > - 1; --r) {<br />         t += digitToBytes(i.digits[r]);<br />     }<br />     return t<br /> }<br /> function digitToBytes(i) <br /> {<br />     var t = String.fromCharCode(255 & i);<br />     i >>>= 8;<br />     var r = String.fromCharCode(255 & i);<br />     return r + t<br /> }<br /> function biDump(i) <br /> {<br />     return (i.isNeg ? "-" : "") + i.digits.join(" ")<br /> }<br /> function biAdd(i, t) <br /> {<br />     var r;<br />     if (i.isNeg != t.isNeg) {<br />         t.isNeg = !t.isNeg, r = biSubtract(i, t), t.isNeg = !t.isNeg;<br />     }<br />     else <br />     {<br />         r = new BigInt;<br />         for (var e, n = 0, g = 0; g < i.digits.length; ++g) {<br />             e = i.digits[g] + t.digits[g] + n, r.digits[g] = 65535 & e, n = Number(e >= biRadix);<br />         }<br />         r.isNeg = i.isNeg <br />     }<br />     return r<br /> }<br /> function biSubtract(i, t) <br /> {<br />     var r;<br />     if (i.isNeg != t.isNeg) {<br />         t.isNeg = !t.isNeg, r = biAdd(i, t), t.isNeg = !t.isNeg;<br />     }<br />     else <br />     {<br />         r = new BigInt;<br />         var e, n;<br />         n = 0;<br />         for (var g = 0; g < i.digits.length; ++g)<br />         {<br />             e = i.digits[g] - t.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix), <br />             n = 0 - Number(e < 0);<br />         }<br />         if (n == - 1) <br />         {<br />             n = 0;<br />             for (var g = 0; g < i.digits.length; ++g)<br />             {<br />                 e = 0 - r.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix), <br />                 n = 0 - Number(e < 0);<br />             }<br />             r.isNeg = !i.isNeg <br />         }<br />         else {<br />             r.isNeg = i.isNeg ;<br />         }<br />     }<br />     return r<br /> }<br /> function biHighIndex(i) <br /> {<br />     for (var t = i.digits.length - 1; t > 0 && 0 == i.digits[t]; ) {<br />         --t;<br />     }<br />     return t<br /> }<br /> function biNumBits(i) <br /> {<br />     var t, r = biHighIndex(i), e = i.digits[r], n = (r + 1) * bitsPerDigit;<br />     for (t = n; t > n - bitsPerDigit && 0 == (32768 & e); --t) {<br />         e <<= 1;<br />     }<br />     return t<br /> }<br /> function biMultiply(i, t) <br /> {<br />     for (var r, e, n, g = new BigInt, s = biHighIndex(i), d = biHighIndex(t), o = 0; o <= d; ++o) <br />     {<br />         for (r = 0, n = o, j = 0; j <= s; ++j, ++n)<br />         {<br />             e = g.digits[n] + i.digits[j] * t.digits[o] + r, g.digits[n] = e & maxDigitVal, r = e >>> biRadixBits;<br />         }<br />         g.digits[o + s + 1] = r <br />     }<br />     return g.isNeg = i.isNeg != t.isNeg, g<br /> }<br /> function biMultiplyDigit(i, t) <br /> {<br />     var r, e, n;<br />     result = new BigInt, r = biHighIndex(i), e = 0;<br />     for (var g = 0; g <= r; ++g)<br />     {<br />         n = result.digits[g] + i.digits[g] * t + e, result.digits[g] = n & maxDigitVal, e = n >>> biRadixBits;<br />     }<br />     return result.digits[1 + r] = e, result<br /> }<br /> function arrayCopy(i, t, r, e, n) <br /> {<br />     for (var g = Math.min(t + n, i.length), s = t, d = e; s < g; ++s, ++d) {<br />         r[d] = i<strike>;<br />     }<br /> }<br /> function biShiftLeft(i, t) <br /> {<br />     var r = Math.floor(t  / bitsPerDigit) , e = new BigInt;<br />     arrayCopy(i.digits, 0, e.digits, r, e.digits.length - r);<br />     for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = e.digits.length - 1, d = s - 1; s > 0; --s, <br />     --d) e.digits<strike> = e.digits<strike> << n & maxDigitVal | (e.digits[d] & highBitMasks[n]) >>> g;<br />     return e.digits[0] = e.digits<strike> << n & maxDigitVal, e.isNeg = i.isNeg, e<br /> }<br /> function biShiftRight(i, t) <br /> {<br />     var r = Math.floor(t  / bitsPerDigit) , e = new BigInt;<br />     arrayCopy(i.digits, r, e.digits, 0, i.digits.length - r);<br />     for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = 0, d = s + 1; s < e.digits.length - 1; ++s, <br />     ++d) e.digits<strike> = e.digits<strike> >>> n | (e.digits[d] & lowBitMasks[n]) << g;<br />     return e.digits[e.digits.length - 1] >>>= n, e.isNeg = i.isNeg, e<br /> }<br /> function biMultiplyByRadixPower(i, t) <br /> {<br />     var r = new BigInt;<br />     return arrayCopy(i.digits, 0, r.digits, t, r.digits.length - t), r<br /> }<br /> function biDivideByRadixPower(i, t) <br /> {<br />     var r = new BigInt;<br />     return arrayCopy(i.digits, t, r.digits, 0, r.digits.length - t), r<br /> }<br /> function biModuloByRadixPower(i, t) <br /> {<br />     var r = new BigInt;<br />     return arrayCopy(i.digits, 0, r.digits, 0, t), r<br /> }<br /> function biCompare(i, t) <br /> {<br />     if (i.isNeg != t.isNeg) {<br />         return 1 - 2 * Number(i.isNeg);<br />     }<br />     for (var r = i.digits.length - 1; r >= 0; --r)<br />     {<br />         if (i.digits[r] != t.digits[r])<br />         {<br />             return i.isNeg ? 1 - 2 * Number(i.digits[r] > t.digits[r]) : 1 - 2 * Number(i.digits[r] < t.digits[r]);<br />         }<br />         return 0;<br />     }<br /> }<br /> function biDivideModulo(i, t) <br /> {<br />     var r, e, n = biNumBits(i), g = biNumBits(t), s = t.isNeg;<br />     if (n < g)<br />     {<br />         return i.isNeg ? (r = biCopy(bigOne), r.isNeg = !t.isNeg, i.isNeg = !1, t.isNeg = !1, e = biSubtract(t, <br />         i), i.isNeg = !0, t.isNeg = s) : (r = new BigInt, e = biCopy(i)), new Array(r, e);<br />     }<br />     r = new BigInt, e = i;<br />     for (var d = Math.ceil(g  / bitsPerDigit) - 1, o = 0; t.digits[d] < biHalfRadix; ) {<br />         t = biShiftLeft(t, 1), ++o, ++g, d = Math.ceil(g  / bitsPerDigit) - 1;<br />     }<br />     e = biShiftLeft(e, o), n += o;<br />     for (var a = Math.ceil(n  / bitsPerDigit) - 1, u = biMultiplyByRadixPower(t, a - d); biCompare(e, <br />     u) != - 1;<br />     ) ++r.digits[a - d], e = biSubtract(e, u);<br />     for (var b = a; b > d; --b) <br />     {<br />         var l = b >= e.digits.length ? 0 : e.digits<strong> , h = b - 1 >= e.digits.length ? 0 : e.digits[b - 1] , <br />         f = b - 2 >= e.digits.length ? 0 : e.digits[b - 2] , c = d >= t.digits.length ? 0 : t.digits[d] , <br />         m = d - 1 >= t.digits.length ? 0 : t.digits[d - 1];<br />         l == c ? r.digits[b - d - 1] = maxDigitVal : r.digits[b - d - 1] = Math.floor((l * biRadix + h)  / c);<br />         for (var x = r.digits[b - d - 1] * (c * biRadix + m), v = l * biRadixSquared + (h * biRadix + f); x > v; )<br />         {<br />             --r.digits[b - d - 1], x = r.digits[b - d - 1] * (c * biRadix | m), v = l * biRadix * biRadix + (h * biRadix + f);<br />         }<br />         u = biMultiplyByRadixPower(t, b - d - 1), e = biSubtract(e, biMultiplyDigit(u, r.digits[b - d - 1])), <br />         e.isNeg && (e = biAdd(e, u), --r.digits[b - d - 1]) <br />     }<br />     return e = biShiftRight(e, o), r.isNeg = i.isNeg != s, i.isNeg && (r = s ? biAdd(r, bigOne) : biSubtract(r, <br />     bigOne), t = biShiftRight(t, o), e = biSubtract(t, e)), 0 == e.digits[0] && 0 == biHighIndex(e) && (e.isNeg = !1), <br />     new Array(r, e)<br /> }<br /> function biDivide(i, t) <br /> {<br />     return biDivideModulo(i, t)[0]<br /> }<br /> function biModulo(i, t) <br /> {<br />     return biDivideModulo(i, t)[1]<br /> }<br /> function biMultiplyMod(i, t, r) <br /> {<br />     return biModulo(biMultiply(i, t), r)<br /> }<br /> function biPow(i, t) <br /> {<br />     for (var r = bigOne, e = i; ; ) {<br />         if (0 != (1 & t) && (r = biMultiply(r, e)), t >>= 1, 0 == t) {<br />             break;<br />         }<br />         e = biMultiply(e, e) <br />     }<br />     return r<br /> }<br /> function biPowMod(i, t, r) <br /> {<br />     for (var e = bigOne, n = i, g = t; ; ) <br />     {<br />         if (0 != (1 & g.digits[0]) && (e = biMultiplyMod(e, n, r)), g = biShiftRight(g, 1), 0 == g.digits[0] && 0 == biHighIndex(g)) {<br />             break;<br />         }<br />         n = biMultiplyMod(n, n, r) <br />     }<br />     return e<br /> }<br /> function RSAKeyPair(i, t, r, e) <br /> {<br />     this.e = biFromHex(i), this.d = biFromHex(t), this.m = biFromHex(r), "number" != typeof e ? this.chunkSize = 2 * biHighIndex(this.m) : this.chunkSize = e  / 8, <br />     this.radix = 16, this.barrett = new BarrettMu(this.m)<br /> }<br /> function encryptedString(i, t, r, e) <br /> {<br />     var n, g, s, d, o, a, u, b, l, h, f = new Array, c = t.length, m = "";<br />     for (d = "string" == typeof r ? r == RSAAPP.NoPadding ? 1 : r == RSAAPP.PKCS1Padding ? 2 : 0 : 0, <br />     o = "string" == typeof e && e == RSAAPP.RawEncoding ? 1 : 0, 1 == d ? c > i.chunkSize && (c = i.chunkSize) : 2 == d && c > i.chunkSize - 11 && (c = i.chunkSize - 11), <br />     n = 0, g = 2 == d ? c - 1 : i.chunkSize - 1;<br />     n < c;<br />     ) d ? f[g] = t.charCodeAt(n) : f[n] = t.charCodeAt(n), n++, g--;<br />     for (1 == d && (n = 0), g = i.chunkSize - c % i.chunkSize; g > 0; ) <br />     {<br />         if (2 == d) {<br />             for (a = Math.floor(256 * Math.random()); !a; ) {<br />                 a = Math.floor(256 * Math.random());<br />             }<br />             f[n] = a <br />         }<br />         else {<br />             f[n] = 0;<br />         }<br />         n++, g-- <br />     }<br />     for (2 == d && (f[c] = 0, f[i.chunkSize - 2] = 2, f[i.chunkSize - 1] = 0), u = f.length, n = 0; n < u; n += i.chunkSize) <br />     {<br />         for (b = new BigInt, g = 0, s = n; s < n + i.chunkSize; ++g) {<br />             b.digits[g] = f[s++], b.digits[g] += f[s++] << 8;<br />         }<br />         l = i.barrett.powMod(b, i.e), h = 1 == o ? biToBytes(l) : 16 == i.radix ? biToHex(l) : biToString(l, <br />         i.radix), m += h <br />     }<br />     return m<br /> }<br /> function decryptedString(i, t) <br /> {<br />     var r, e, n, g, s = t.split(" "), d = "";<br />     for (e = 0; e < s.length; ++e)<br />     {<br />         for (g = 16 == i.radix ? biFromHex(s[e]) : biFromString(s[e], i.radix), r = i.barrett.powMod(g, <br />         i.d), n = 0;<br />         n <= biHighIndex(r);<br />         ++n) d += String.fromCharCode(255 & r.digits[n], r.digits[n] >> 8);<br />     }<br />     return 0 == d.charCodeAt(d.length - 1) && (d = d.substring(0, d.length - 1)), d<br /> }<br /> var biRadixBase = 2, biRadixBits = 16, bitsPerDigit = biRadixBits, biRadix = 65536, biHalfRadix = biRadix >>> 1, <br /> biRadixSquared = biRadix * biRadix, maxDigitVal = biRadix - 1, maxInteger = 9999999999999998, maxDigits, <br /> ZERO_ARRAY, bigZero, bigOne;<br /> setMaxDigits(20);<br /> var dpl10 = 15 , lr10 = biFromNumber(1e15) , hexatrigesimalToChar = new Array("0", "1", "2", "3", "4", <br /> "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", <br /> "q", "r", "s", "t", "u", "v", "w", "x", "y", "z") , hexToChar = new Array("0", "1", "2", "3", "4", "5", <br /> "6", "7", "8", "9", "a", "b", "c", "d", "e", "f") , highBitMasks = new Array(0, 32768, 49152, 57344, 61440, <br /> 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535) , lowBitMasks = new Array(0, <br /> 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535) , RSAAPP = {};<br /> RSAAPP.NoPadding = "NoPadding", RSAAPP.PKCS1Padding = "PKCS1Padding", RSAAPP.RawEncoding = "RawEncoding", <br /> RSAAPP.NumericEncoding = "NumericEncoding";<br /> var Base64 = <br /> {<br />     enKey : 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/', deKey : new Array( - 1, <br />      - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, <br />      - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, <br />      - 1, - 1, 62, - 1, - 1, - 1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, - 1, - 1, - 1, - 1, - 1, <br />      - 1, - 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, <br />     25, - 1, - 1, - 1, - 1, - 1, - 1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, <br />     42, 43, 44, 45, 46, 47, 48, 49, 50, 51, - 1, - 1, - 1, - 1, - 1),<br />     encode : function (src) <br />     {<br />         var str = new Array();<br />         var ch1, ch2, ch3;<br />         var pos = 0;<br />         while (pos + 3 <= src.length) <br />         {<br />             ch1 = src.charCodeAt(pos++);<br />             ch2 = src.charCodeAt(pos++);<br />             ch3 = src.charCodeAt(pos++);<br />             str.push(this.enKey.charAt(ch1 >> 2), this.enKey.charAt(((ch1 << 4) + (ch2 >> 4)) & 0x3f));<br />             str.push(this.enKey.charAt(((ch2 << 2) + (ch3 >> 6)) & 0x3f), this.enKey.charAt(ch3 & 0x3f));<br />         }<br />         if (pos < src.length) <br />         {<br />             ch1 = src.charCodeAt(pos++);<br />             str.push(this.enKey.charAt(ch1 >> 2));<br />             if (pos < src.length) <br />             {<br />                 ch2 = src.charCodeAt(pos);<br />                 str.push(this.enKey.charAt(((ch1 << 4) + (ch2 >> 4)) & 0x3f));<br />                 str.push(this.enKey.charAt(ch2 << 2 & 0x3f), '=');<br />             }<br />             else {<br />                 str.push(this.enKey.charAt(ch1 << 4 & 0x3f), '==');<br />             }<br />         }<br />         return str.join('');<br />     },<br />     decode : function (src) <br />     {<br />         var str = new Array();<br />         var ch1, ch2, ch3, ch4;<br />         var pos = 0;<br />         src = src.replace(/[^A-Za-z0-9\+\/]/g, '');<br />         while (pos + 4 <= src.length) <br />         {<br />             ch1 = this.deKey[src.charCodeAt(pos++)];<br />             ch2 = this.deKey[src.charCodeAt(pos++)];<br />             ch3 = this.deKey[src.charCodeAt(pos++)];<br />             ch4 = this.deKey[src.charCodeAt(pos++)];<br />             str.push(String.fromCharCode((ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2), <br />             (ch3 << 6 & 0xff) + ch4));<br />         }<br />         if (pos + 1 < src.length) <br />         {<br />             ch1 = this.deKey[src.charCodeAt(pos++)];<br />             ch2 = this.deKey[src.charCodeAt(pos++)];<br />             if (pos < src.length) <br />             {<br />                 ch3 = this.deKey[src.charCodeAt(pos)];<br />                 str.push(String.fromCharCode((ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2)));<br />             }<br />             else {<br />                 str.push(String.fromCharCode((ch1 << 2 & 0xff) + (ch2 >> 4)));<br />             }<br />         }<br />         return str.join('');<br />     }<br /> };<br /> //Base64.encode(pass);<br /> function test(c, pwd)<br /> {<br />     setMaxDigits(131);<br />     c = new RSAKeyPair("3", "10001", c, 1024);<br />     return Base64.encode(encryptedString(c, pwd, RSAAPP.PKCS1Padding, RSAAPP.RawEncoding));<br /> }

朱辉

比如 我这样   test('BC371674B093E0BBA44A18B42FE8672D8E7378F8D30BE069D8DB39F2878C0B988404D9FB5FAA6AF4F769011E040FE3FE4018633D77F3D56C1D3A9953C338E6461949353CEE1FB6A2EF79F2AAECC6204E33BFCFF4F7574445A52719161786B41CC4D9887E5EEE275DAFAFDB7AE6C75C4B6AAFFE0841B831169BDFA424B61FC4CF','zhuhui1994')