苏宁易购密码RSA加密

最新推荐文章于 2024-05-08 10:31:15 发布

cheshu4043

最新推荐文章于 2024-05-08 10:31:15 发布

阅读量512

点赞数

文章标签：移动开发 c/c++

原文链接：https://my.oschina.net/u/3900823/blog/1839697

版权

window = this;
navigator = {};
var JSEncryptExports = {};
(function(ap) {
var bE;
var n = 244837814094590;
var aV = ((n & 16777215) == 15715070);

function bf(z, t, L) {
if (z != null) {
if ("number" == typeof z) {
this.fromNumber(z, t, L)
} else {
if (t == null && "string" != typeof z) {
this.fromString(z, 256)
} else {
this.fromString(z, t)
}
}
}
}

function bm() {
return new bf(null)
}

function a7(bX, t, z, bW, bZ, bY) {
while (--bY >= 0) {
var L = t * this[bX++] + z[bW] + bZ;
bZ = Math.floor(L / 67108864);
z[bW++] = L & 67108863
}
return bZ
}

function a6(bX, b2, b3, bW, b0, t) {
var bZ = b2 & 32767,
b1 = b2 >> 15;
while (--t >= 0) {
var L = this[bX] & 32767;
var bY = this[bX++] >> 15;
var z = b1 * L + bY * bZ;
L = bZ * L + ((z & 32767) << 15) + b3[bW] + (b0 & 1073741823);
b0 = (L >>> 30) + (z >>> 15) + b1 * bY + (b0 >>> 30);
b3[bW++] = L & 1073741823
}
return b0
}

function Y(t) {
return a.charAt(t)
}

function aX(z, t) {
var L = g[z.charCodeAt(t)];
return (L == null) ? -1 : L
}

function d(z) {
for (var t = this.t - 1; t >= 0; --t) {
z[t] = this[t]
}
z.t = this.t;
z.s = this.s
}

function h(t) {
this.t = 1;
this.s = (t < 0) ? -1 : 0;
if (t > 0) {
this[0] = t
} else {
if (t < -1) {
this[0] = t + this.DV
} else {
this.t = 0
}
}
}

function bi(t) {
var z = bm();
z.fromInt(t);
return z
}

function bA() {
var t = this.s & this.DM;
while (this.t > 0 && this[this.t - 1] == t) {
--this.t
}
}

function bC() {
var t = bm();
bf.ZERO.subTo(this, t);
return t
}

function bB() {
return (this.s < 0) ? this.negate() : this
}

function bt() {
if (this.t <= 0) {
return 0
}
return this.DB * (this.t - 1) + q(this[this.t - 1] ^ (this.s & this.DM))
}

function bv(L, z) {
var t;
for (t = this.t - 1; t >= 0; --t) {
z[t + L] = this[t]
}
for (t = L - 1; t >= 0; --t) {
z[t] = 0
}
z.t = this.t + L;
z.s = this.s
}

function a2(L, z) {
for (var t = L; t < this.t; ++t) {
z[t - L] = this[t]
}
z.t = Math.max(this.t - L, 0);
z.s = this.s
}

function bh(t) {
var z = bm();
this.abs().divRemTo(t, null, z);
if (this.s < 0 && z.compareTo(bf.ZERO) > 0) {
t.subTo(z, z)
}
return z
}

function aT(t) {
this.m = t
}

function aI(t) {
if (t.s < 0 || t.compareTo(this.m) >= 0) {
return t.mod(this.m)
} else {
return t
}
}

function c(t) {
return t
}

function V(t) {
t.divRemTo(this.m, null, t)
}

function p(t, L, z) {
t.multiplyTo(L, z);
this.reduce(z)
}

function aF(t, z) {
t.squareTo(z);
this.reduce(z)
}
aT.prototype.convert = aI;
aT.prototype.revert = c;
aT.prototype.reduce = V;
aT.prototype.mulTo = p;
aT.prototype.sqrTo = aF;

function K(t) {
this.m = t;
this.mp = t.invDigit();
this.mpl = this.mp & 32767;
this.mph = this.mp >> 15;
this.um = (1 << (t.DB - 15)) - 1;
this.mt2 = 2 * t.t
}

function by(t) {
var z = bm();
t.abs().dlShiftTo(this.m.t, z);
z.divRemTo(this.m, null, z);
if (t.s < 0 && z.compareTo(bf.ZERO) > 0) {
this.m.subTo(z, z)
}
return z
}

function bl(t) {
var z = bm();
t.copyTo(z);
this.reduce(z);
return z
}

function ac(t, z) {
t.squareTo(z);
this.reduce(z)
}

function bz(t, L, z) {
t.multiplyTo(L, z);
this.reduce(z)
}
K.prototype.convert = by;
K.prototype.revert = bl;
K.prototype.reduce = bV;
K.prototype.mulTo = bz;
K.prototype.sqrTo = ac;

function ad() {
return ((this.t > 0) ? (this[0] & 1) : this.s) == 0
}

function f() {
var t = bm();
this.copyTo(t);
return t
}

function b() {
if (this.s < 0) {
if (this.t == 1) {
return this[0] - this.DV
} else {
if (this.t == 0) {
return -1
}
}
} else {
if (this.t == 1) {
return this[0]
} else {
if (this.t == 0) {
return 0
}
}
}
return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0]
}

function bF() {
return (this.t == 0) ? this.s : (this[0] << 24) >> 24
}

function ag() {
return (this.t == 0) ? this.s : (this[0] << 16) >> 16
}

function aU(t) {
return Math.floor(Math.LN2 * this.DB / Math.log(t))
}

function aZ() {
if (this.s < 0) {
return -1
} else {
if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) {
return 0
} else {
return 1
}
}
}

function bG(t) {
return (this.compareTo(t) == 0)
}

function W(t) {
return (this.compareTo(t) < 0) ? this : t
}

function bu(t) {
return (this.compareTo(t) > 0) ? this : t
}

function o(t, z) {
return t & z
}

function bO(t) {
var z = bm();
this.bitwiseTo(t, o, z);
return z
}

function ak(t, z) {
return t | z
}

function aS(t) {
var z = bm();
this.bitwiseTo(t, ak, z);
return z
}

function aa(t, z) {
return t ^ z
}

function B(t) {
var z = bm();
this.bitwiseTo(t, aa, z);
return z
}

function i(t, z) {
return t & ~z
}

function aD(t) {
var z = bm();
this.bitwiseTo(t, i, z);
return z
}

function T() {
var z = bm();
for (var t = 0; t < this.t; ++t) {
z[t] = this.DM & ~this[t]
}
z.t = this.t;
z.s = ~this.s;
return z
}

function aN(z) {
var t = bm();
if (z < 0) {
this.rShiftTo(-z, t)
} else {
this.lShiftTo(z, t)
}
return t
}

function R(z) {
var t = bm();
if (z < 0) {
this.lShiftTo(-z, t)
} else {
this.rShiftTo(z, t)
}
return t
}

function aq() {
for (var t = 0; t < this.t; ++t) {
if (this[t] != 0) {
return t * this.DB + bc(this[t])
}
}
if (this.s < 0) {
return this.t * this.DB
}
return -1
}

function bj(t) {
var z = 0;
while (t != 0) {
t &= t - 1;
++z
}
return z
}

function ao() {
var L = 0,
t = this.s & this.DM;
for (var z = 0; z < this.t; ++z) {
L += bj(this[z] ^ t)
}
return L
}

function aL(z) {
var t = Math.floor(z / this.DB);
if (t >= this.t) {
return (this.s != 0)
}
return ((this[t] & (1 << (z % this.DB))) != 0)
}

function U(L, z) {
var t = bf.ONE.shiftLeft(L);
this.bitwiseTo(t, z, t);
return t
}

function a1(t) {
return this.changeBit(t, ak)
}

function ah(t) {
return this.changeBit(t, i)
}

function aO(t) {
return this.changeBit(t, aa)
}

function bg(t) {
var z = bm();
this.addTo(t, z);
return z
}

function aA(t) {
var z = bm();
this.subTo(t, z);
return z
}

function bH(t) {
var z = bm();
this.multiplyTo(t, z);
return z
}

function bU() {
var t = bm();
this.squareTo(t);
return t
}

function bd(t) {
var z = bm();
this.divRemTo(t, z, null);
return z
}

function bP(t) {
var z = bm();
this.divRemTo(t, null, z);
return z
}

function bk(t) {
var L = bm(),
z = bm();
this.divRemTo(t, L, z);
return new Array(L, z)
}

function e(t) {
this[this.t] = this.am(0, t - 1, this, 0, 0, this.t);
++this.t;
this.clamp()
}

function aR(z, t) {
if (z == 0) {
return
}
while (this.t <= t) {
this[this.t++] = 0
}
this[t] += z;
while (this[t] >= this.DV) {
this[t] -= this.DV;
if (++t >= this.t) {
this[this.t++] = 0
}++this[t]
}
}

function Z() {}

function bw(t) {
return t
}

function bK(t, L, z) {
t.multiplyTo(L, z)
}

function ai(t, z) {
t.squareTo(z)
}
Z.prototype.convert = bw;
Z.prototype.revert = bw;
Z.prototype.mulTo = bK;
Z.prototype.sqrTo = ai;

function Q(t) {
return this.exp(t, new Z())
}

function bR(t) {
this.r2 = bm();
this.q3 = bm();
bf.ONE.dlShiftTo(2 * t.t, this.r2);
this.mu = this.r2.divide(t);
this.m = t
}

function H(t) {
if (t.s < 0 || t.t > 2 * this.m.t) {
return t.mod(this.m)
} else {
if (t.compareTo(this.m) < 0) {
return t
} else {
var z = bm();
t.copyTo(z);
this.reduce(z);
return z
}
}
}

function bM(t) {
return t
}

function aM(t, z) {
t.squareTo(z);
this.reduce(z)
}

function x(t, L, z) {
t.multiplyTo(L, z);
this.reduce(z)
}
bR.prototype.convert = H;
bR.prototype.revert = bM;
bR.prototype.reduce = D;
bR.prototype.mulTo = x;
bR.prototype.sqrTo = aM;

function bp() {
this.i = 0;
this.j = 0;
this.S = new Array()
}

function be() {
var z;
this.i = (this.i + 1) & 255;
this.j = (this.j + this.S[this.i]) & 255;
z = this.S[this.i];
this.S[this.i] = this.S[this.j];
this.S[this.j] = z;
return this.S[(z + this.S[this.i]) & 255]
}
bp.prototype.init = af;
bp.prototype.next = be;

function aY(z) {
var t;
for (t = 0; t < z.length; ++t) {
z[t] = bb()
}
}

function G() {}
G.prototype.nextBytes = aY;

function w(z, t) {
return new bf(z, t)
}

function m(L, bW) {
var t = "";
var z = 0;
while (z + bW < L.length) {
t += L.substring(z, z + bW) + "\n";
z += bW
}
return t + L.substring(z, L.length)
}

function br(t) {
if (t < 16) {
return "0" + t.toString(16)
} else {
return t.toString(16)
}
}

function A() {
this.n = null;
this.e = 0;
this.d = null;
this.p = null;
this.q = null;
this.dmp1 = null;
this.dmq1 = null;
this.coeff = null
}

function an(z, t) {
if (z != null && t != null && z.length > 0 && t.length > 0) {
this.n = w(z, 16);
this.e = parseInt(t, 16)
} else {
console.error("Invalid RSA public key")
}
}

function bq(t) {
return t.modPowInt(this.e, this.n)
}

function aC(L, t, z) {
if (L != null && t != null && L.length > 0 && t.length > 0) {
this.n = w(L, 16);
this.e = parseInt(t, 16);
this.d = w(z, 16)
} else {
console.error("Invalid RSA private key")
}
}

function ay(t) {
if (this.p == null || this.q == null) {
return t.modPow(this.d, this.n)
}
var L = t.mod(this.p).modPow(this.dmp1, this.p);
var z = t.mod(this.q).modPow(this.dmq1, this.q);
while (L.compareTo(z) < 0) {
L = L.add(this.p)
}
return L.subtract(z).multiply(this.coeff).mod(this.p).multiply(this.q).add(z)
}

function getPwd(pwd) {
var encrypt = new JSEncrypt();
loginPBK= "MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQComqoAyvbCqO1EGsADwfNTWFQIUbm8CLdeb9TgjGLcz95mAo204SqTYdSEUxFsOnPfROOTxhkhfjbRxBV4/xjS06Y+kkUdiMGFtABIxRQHQIh0LrVvEZQs4NrixxcPI+b1bpE0gO/GAFSNWm9ejhZGj7UnqiHphnSJAVQNz2lgowIDAQAB";
encrypt.setPublicKey(loginPBK);
return encrypt.encrypt(pwd);
}

转载于:https://my.oschina.net/u/3900823/blog/1839697