JS ??? ??:

?? ?? ??? ??? ????.

//文件base64.js:
var b64map="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789 /";
var b64pad="=";
function hex2b64(h) {
var i;
var c;
var ret = "";
for(i = 0; i 3 c =parseInt(h.substring(i,i 3),16);
ret = b64map.charAt(c >> 6) b64map.charAt(c & 63);
}
if(i 1 == h.length) {
c =parseInt(h.substring(i,i 1),16);
ret = b64map.charAt(c << 2);
}
else if(i 2 == h.length) {
c =parseInt(h.substring(i,i 2),16);
ret = b64map.charAt(c >> 2) b64map.charAt((c & 3) << 4);
}
while((ret.length & 3) > 0) ret = b64pad;
?? ??;
}
// base64 ???? 16??? ??
function b64tohex(s) {
var ret = ""
var i;
var k = 0; // b64 ??, 0-3
var slop;
for(i = 0; i if(s.charAt(i) == b64pad) break;
v = b64map.indexOf(s.charAt(i));
if(v if(k == 0) {
ret = int2char(v >> 2);
?? = v & 3;
k = 1;
}
else if(k == 1) {
ret = int2char((slop << 2) | (v >4));
?? = v & 0xf;
k = 2;
}
else if(k == 2) {
ret = int2char(slop);
ret = int2char(v >> 2);
?? = v & 3;
k = 3;
}
else {
ret = int2char((slop << 2) | (v >> 4));
ret = int2char(v & 0xf);
k = 0;
}
}
if(k == 1)
ret = int2char(slop << 2);
?? ??;
}
// base64 ???? ???/?? ??? ??
function b64toBA(s) {
//??? b64tohex? ????? ??? ??????
var h = b64tohex(s );
var i;
var a = new Array();
for(i = 0; 2*i < h.length; i) {
a[i] = parsInt(h.substring(2*i,2*i 2),16);
}
return a;
}
#文件jsbn.js
// Copyright (c) 2005 Tom Wu
// All Rights Reserved.
// ??? ??? '????'? ?????.
// ?? JavaScript BN ????? - RSA ???? ??? ?? ?????.
// ???? ?? ?
var dbits;
// ?????? ?? ??
var canary = 0xdeadbeefcafe;
var j_lm = ((canary&0xffffff)==0xefcafe);
// (??) ???
function BigInteger(a,b,c) {
if(a != null)
if("number" == typeof a) this.fromNumber(a ,???);
else if(b == null && "string" != typeof a) this.fromString(a,256);
??? ??? this.fromString(a,b);
}
// ??? BigInteger ??, ?? ??? BigInteger
function nbi() { return new BigInteger(null); }
// am: w_j = (x*this_i) ??, ?? ??,
// c? ?? ??, ?? ??? ?????.
// c < 3*d?, x < 2*d?, this_i < dvalue
// ? ???? ???? ?? ?? ?? ???? ???.
// am1: ?? ??? ???? ???? ?? ??? ????.
//
// ?? ?? ? = 2*dvalue^2-2*dvalue??? ?? ?? ??? 26??? ???( < 2^53)
function am1(i,x,w,j,c,n) {
while(--n >= 0) {
var v = x*this[i ] w[j] c;
c = Math.floor(v/0x4000000);
w[j ] = v&0x3ffffff;
}
c? ?????.
}
// am2? ? ?? ??? ??? ????.
// ?? ?? ??? ????? ?? ??? ??? <= 30??? ???.
// ?? 2*hdvalue^2-hdvalue-1 (< 2^31) ?? ??
function am2( i,x,w,j,c,n) {
var xl = x&0x7fff, xh = x>>15;
while(--n >= 0) {
var l = this[i]&0x7fff;
var h = this[i ]>>15;
var m = xh*l h*xl;
l = xl*l ((m&0x7fff)<<15) w[j] (c&0x3fffffff);
c = (l>>>30) (m>>15) xh*h (c>>>30);
w[j ] = l&0x3fffffff;
}
c? ?????.
}
// ??
// ????? 32?? ??? ??? ? ??? ????? ?? ??? ??? 28? ?????.
function am3(i,x,w,j,c,n) {
var xl = x&0x3fff, xh = x>>14;
while(--n >= 0) {
var l = this[i]&0x3fff;
var h = this[i ]>>14;
var m = xh*l h*xl;
l = xl*l ((m&0x3fff)<<14) w[j] c;
c = (l>>28) (m>14) xh*h;
w[j ] = l&0xfffffff;
}
c? ?????.
}
if(j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
BigInteger.prototype.am = am2;
dbit = 30;
}
else if(j_lm && (navigator.appName != "Netscape")) {
BigInteger.prototype.am = am1;
dbit = 26;
}
else { // Mozilla/Netscape? am3? ???? ? ????.
BigInteger.prototype.am = am3;
dbit = 28;
}
BigInteger.prototype.DB = dbits;
BigInteger.prototype.DM = ((1BigInteger.prototype.DV = (1var BI_FP = 52;
BigInteger.prototype.FV = Math.pow(2,BI_FP);
BigInteger.prototype.F1 = BI_FP-dbits;
BigInteger.prototype.F2 = 2*dbits-BI_FP;
// ?? ??
var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
var BI_RC = new Array();
var rr,vv;
rr = "0".charCodeAt(0);
for(vv = 0; vv rr = "a".charCodeAt(0);
for(vv = 10; vv rr = "A".charCodeAt(0);
for(vv = 10; vv ?? int2char(n) { return BI_RM.charAt(n); }
function intAt(s,i) {
var c = BI_RC[s.charCodeAt(i)];
return (c==null)?-1:c;
}
// (???) ??? r? ??
function bnpCopyTo(r) {
for(var i = this.t-1; i >= 0; --i) r [i] = ?[i];
r.t = this.t;
r.s = this.s;
}
// (???) ?? ? x?? ???, -DV <= x < DV
function bnpFromInt(x) {
this.t = 1;
this.s = (x<0)?-1:0;
if(x > 0) this[0] = x;
else if(x < -1) this[0] = x DV;
??? ??? this.t = 0;
}
// ??? ???? bigint ??
function nbv(i) { var r = nbi(); r.fromInt(i); r? ??; }
// (???) ???? ??? ??
function bnpFromString(s,b) {
var k;
if(b == 16) k = 4;
else if(b == 8) k = 3;
else if(b == 256) k = 8; // ??? ??
else if(b == 2) k = 1;
else if(b == 32) k = 5;
else if(b == 4) k = 2;
else { this.fromRadix(s,b); ??; }
this.t = 0;
this.s = 0;
var i = s.length, mi = false, sh = 0;
while(--i >= 0) {
var x = (k==8)?s[i]&0xff:intAt(s,i);
if(x < 0) {
if(s.charAt(i) == "-") mi = true;
??;
}
? = ??;
if(sh == 0)
this[this.t ] = x;
else if(sh k > this.DB) {
this[this.t-1] |= (x&((1<(this.DB-sh))-1))< this[this.t ] = (x>>(this.DB-sh));
}
else
this[this.t-1] |= xsh=k;
if(sh >= this.DB) sh -= this.DB;
}
if(k == 8 && (s[0]&0x80) != 0) {
this.s = -1;
if(sh > 0) this[this.t-1] |= ((1}
this.clamp();
if(mi) BigInteger.ZERO.subTo(this,this);
}
// (???) ??? ?? ?? ??
function bnpClamp() {
var c = this.s&this.DM;
while(this.t > 0 && this[this.t-1] == c) --this.t;
}
// (??) ??? ??? ??? ??? ?????.
function bnToString(b) {
if(this.s < 0) return "-" this.negate().toString (?);
var k;
if(b == 16) k = 4;
else if(b == 8) k = 3;
else if(b == 2) k = 1;
else if(b == 32) k = 5;
else if(b == 4) k = 2;
??? ??? this.toRadix(b)? ?????.
var km = (1<var p = this.DB-(i*this.DB)%k;
if(i-- > 0) {
if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }
while(i >= 0) {
if(p < k) {
d = (this[i]&((1<d |= this[--i]>>(p =this.DB-k);
}
else {
d = (this[i]>>(p-=k))&km;
if(p <= 0) { p = this.DB; --?; }
}
if(d > 0) m = true;
if(m) r = int2char(d);
}
}
return m?r:"0";
}
// (??) -this
function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); r? ??; }
// (??) |this|
?? bnAbs() { return (this.s<0)?this.negate():this; }
// (??) > a, - ??? < a, ??? 0
function bnCompareTo(a) {
var r = this.s-a.s;
if(r != 0) return r;
var i = this.t;
r = i-a.t;
if(r != 0) return r;
while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;
0? ?????.
}
// ?? x? ?? ??? ?????.
function nbits(x) {
var r = 1, t;
if((t=x>>>16) != 0) { x = t; r = 16; }
if((t=x>>8) != 0) { x = t; r = 8; }
if((t=x>>4) != 0) { x = t; r = 4; }
if((t=x>>2) != 0) { x = t; r = 2; }
if((t=x>>1) != 0) { x = t; r = 1; }
r? ??;
}
// (??) "this"? ?? ?? ?????.
function bnBitLength() {
if(this.t <= 0) return 0;
return this.DB*(this.t-1) nbits(this[this.t-1]^(this.s&this.DM));
}
// (???) r = this << n*DB
function bnpDLShiftTo(n,r) {
var i;
for(i = this.t-1; i >= 0; --i) r[i n] = this[i];
for(i = n-1; i >= 0; --i) r[i] = 0;
r.t = this.t n;
r.s = this.s;
}
// (???) r = this >> n*DB
function bnpDRShiftTo(n,r) {
for(var i = n; i < this.t; i) r[i-n] = this[i];
r.t = Math.max(this.t-n,0);
r.s = this.s;
}
// (???) r = this << n
function bnpLShiftTo(n,r) {
var bs = n%this.DB;
var cbs = this.DB-bs;
var bm = (1<var ds = Math.floor(n/this.DB), c = (this.s<for(i = this.t-1; i >= 0; --i) {
r[i ds 1] = (this[i]>>cbs)|c;
c = (this[i]&bm)<}
for(i = ds-1; i >= 0; --i) r[i] = 0;
r[ds] = c;
r.t = this.t ds 1;
r.s = this.s;
r.clamp();
}
// (???) r = this >> n
?? bnpRShiftTo(n,r) {
r.s = this.s;
var ds = Math.floor(n/this.DB);
if(ds >= this.t) { r.t = 0; ??; }
var bs = n%this.DB;
var cbs = this.DB-bs;
var bm = (1<r[0] = this[ds]>>bs;
for(var i = ds 1; i < this.t; i) {
r[i-ds-1] |= (this[i]&bm)<r[i-ds] = this[i]>>bs;
}
if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<r.t = this.t-ds;
r.clamp();
}
// (???) r = this - a
function bnpSubTo(a,r) {
var i = 0, c = 0, m = Math.min(a.t,this. ?);
while(i < m) {
c = this[i]-a[i];
r[i ] = c&this.DM;
c>>= this.DB;
}
if(a.t < this.t) {
c -= a.s;
while(i < this.t) {
c = this[i];
r[i ] = c&this.DM;
c>>= this.DB;
}
c = this.s;
}
else {
c = this.s;
while(i < a.t) {
c -= a[i];
r[i ] = c&this.DM;
c>>= this.DB;
}
c -= a.s;
}
r.s = (c<0)?-1:0;
if(c < -1) r[i ] = this.DV c;
else if(c > 0) r[i ] = c;
r.t = i;
r.clamp();
}
// (???) r = this * a, r != this,a (HAC 14.12)
// "this"? ???? ?? ? ? ???? ???.
function bnpMultiplyTo(a,r) {
var x = this.abs(), y = a.abs();
var i = x.t;
r.t = i y.t;
while(--i >= 0) r[i] = 0;
for(i = 0; i r.s = 0;
r.clamp();
if(this.s != a.s) BigInteger.ZERO.subTo(r,r);
}
// (???) r = this^2, r != this (HAC 14.16)
function bnpSquareTo(r) {
var x = this.abs();
var i = r.t = 2*x.t;
while(--i >= 0) r[i] = 0;
for(i = 0; i var c = x.am(i,x[i],r,2*i,0,1);
if((r[i x.t] =x.am(i 1,2*x[i],r,2*i 1,c,x.t-i-1)) >= x.DV) {
r[i x.t] -= x.DV;
r[i x.t 1] = 1;
}
}
if(r.t > 0) r[r.t-1] = x.am(i,x[i],r,2*i,0,1);
r.s = 0;
r.clamp();
}
// (???) ??? m, ?, ???? ??? q, r? ????(HAC 14.20)
// r != q, this != m. q ?? r? null? ? ????.
function bnpDivRemTo(m,q,r) {
var pm = m.abs();
if(pm.t <= 0) return;
var pt = this.abs();
if(pt.t < pm.t) {
if(q != null) q.fromInt(0);
if(r != null) this.copyTo(r);
??;
}
if(r == null) r = nbi();
var y = nbi(), ts = this.s, ms = m.s;
var nsh = this.DB-nbits(pm[pm.t-1]); // ???? ???
if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }
else { pm.copyTo(y); pt.copyTo(r); }
var ys = y.t;
var y0 = y[ys-1];
if(y0 == 0) return;
var yt = y0*(1<1)?y[ys-2]>>this.F2:0);
var d1 = this.FV/yt, d2 = (1var i = r.t, j = i-ys, t = (q==null)?nbi():q;
y.dlShiftTo(j,t);
if(r.compareTo(t) >= 0) {
r[r.t ] = 1;
r.subTo(t,r);
}
BigInteger.ONE.dlShiftTo(ys,t);
t.subTo(y,y); // "??" y??? ??? sub? am?? ?? ? ????.
while(y.t < ys) y[y.t ] = 0;
while(--j >= 0) {
// ? ??
var qd = (r[--i]==y0)?this.DM:Math.floor(r[ i]*d1 (r[i-1] e)*d2);
if((r[i] =y.am(0,qd,r,j,0,ys)) < qd) { // ??? ???
y.dlShiftTo(j,t);
r.subTo(t,r);
while(r[i] < --qd) r.subTo(t,r);
}
}
if(q != null) {
r.drShiftTo(ys,q);
if(ts != ms) BigInteger.ZERO.subTo(q,q);
}
r.t = ys;
r.clamp();
if(nsh > 0) r.rShiftTo(nsh,r); // ??? ????
if(ts < 0) BigInteger.ZERO.subTo(r,r);
}
// (??) ? ?? a
function bnMod(a) {
var r = nbi();
this.abs().divRemTo(a,null,r);
if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);
r? ?????;
}
// "???" ????? ??? ??? ??
function Classic(m) { this.m = m; }
function cConvert(x) {
if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
??? ??? x? ?????.
}
function cRevert(x) { return x; }
function cReduce(x) { x.divRemTo(this.m,null,x); }
function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
Classic.prototype.convert = cConvert;
Classic.prototype.revert = cRevert;
Classic.prototype.reduce = cReduce;
Classic.prototype.mulTo = cMulTo;
Classic.prototype.sqrTo = cSqrTo;
// (???) return "-1/this % 2^DB"; Mont?? ?????. ??
// ???:
// xy == 1 (mod m)
// xy = 1km
// xy(2-xy) = (1km)(1-km )
// x[y(2-xy)] = 1-k^2m^2
// x[y(2-xy)] == 1 (mod m^2)
/ / y? 1/x mod m?? y(2-xy)? 1/x mod m^2???.
// ??? ????? ? ???? x? y(2-xy)? m^2? ??? ???. ??.
// JS? C/C? ??? "????"? ???? ???? ??? ?????.
function bnpInvDigit() {
if(this.t < 1) return 0;
var x = this[0];
if((x&1) == 0) return 0;
var y = x&3; // y == 1/x mod 2^2
y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4
y = (y*(2-(x&0xff)*y))&0xff; // y == 1/x mod 2^8
y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff; // y == 1/x mod 2^16
// ??? ?? - ? mod DV? ?? ?????.
// 16 < DB <= 32?? 48?? ??? ??? ? ??? ?????.
y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits
// ??? ??? ?? ?? ???, -DV < y < DV
return (y>0)?this.DV-y:-y;
}
// ???? ??
function Montgomery(m) {
this.m = m;
this.mp = m.invDigit();
this.mpl = this.mp&0x7fff;
this.mph = this.mp>>15;
this.um = (1this.mt2 = 2*m.t;
}
// xR mod m
function montConvert(x) {
var r = nbi();
x.abs().dlShiftTo(this.m.t,r);
r.divRemTo(this.m,null,r);
if(x.s 0) this.m.subTo(r,r);
r? ?????;
}
// x/R mod m
function montRevert(x) {
var r = nbi();
x.copyTo(r);
this.reduce(r);
r? ?????;
}
// x = x/R mod m (HAC 14.32)
function montReduce(x) {
while(x.t <= this.mt2) // ?? x??? am? ?????. ??? ?
x[x.t ] = 0;
for(var i = 0; i < this.m.t; i) {
// u0 = x[i]*mp mod DV? ???? ? ?? ??
var j = x[i]&0x7fff ;
var u0 = (j*this.mpl (((j*this.mph (x[i]>>15)*this.mpl)&this.um)<<15))&x.DM ;
// am? ???? ??-???-??? ??? ??? ?????.
j = i this.m.t;
x[j] = this.m.am(0,u0,x,i,0,this.m.t);
// ?? ??
while(x[j] >= x.DV) { x[j] -= x.DV; x[j] ; }
}
x.clamp();
x.drShiftTo(this.m.t,x);
if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
}
// r = "x^2/R mod m"; x != r
function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
// r = "xy/R ?? m"; x,y != r
function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
Montgomery.prototype.convert = montConvert;
Montgomery.prototype.revert = montRevert;
Montgomery.prototype.reduce = montReduce;
Montgomery.prototype.mulTo = montMulTo;
Montgomery.prototype.sqrTo = montSqrTo;
// (???) ??? ?? true
function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }
// (???) this^e, e < 2^32, "r"? ???? sqr ? mul ??(HAC 14.79)
function bnpExp(e,z) {
if(e > 0xffffffff || e < 1) return BigInteger.ONE;
var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;
g.copyTo(r);
while(--i >= 0) {
z.sqrTo(r,r2);
if((e&(1 0) z.mulTo(r2,g,r);
else { var t = r; r = r2; r2 = ?; }
}
return z.revert(r);
}
// (??) this^e % m, 0 <= e < 2^32
function bnModPowInt(e,m) {
var z;
if(e < 256 || m.isEven()) z = new Classic(m); else z = ??? ????(m);
return this.exp(e,z);
}
// ???
BigInteger.prototype.copyTo = bnpCopyTo;
BigInteger.prototype.fromInt = bnpFromInt;
BigInteger.prototype.fromString = bnpFromString;
BigInteger.prototype.clamp = bnpClamp;
BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
BigInteger.prototype.drShiftTo = bnpDRShiftTo;
BigInteger.prototype.lShiftTo = bnpLShiftTo;
BigInteger.prototype.rShiftTo = bnpRShiftTo;
BigInteger.prototype.subTo = bnpSubTo;
BigInteger.prototype.multiplyTo = bnpMultiplyTo;
BigInteger.prototype.squareTo = bnpSquareTo;
BigInteger.prototype.divRemTo = bnpDivRemTo;
BigInteger.prototype.invDigit = bnpInvDigit;
BigInteger.prototype.isEven = bnpIsEven;
BigInteger.prototype.exp = bnpExp;
// ??
BigInteger.prototype.toString = bnToString;
BigInteger.prototype.negate = bnNegate;
BigInteger.prototype.abs = bnAbs;
BigInteger.prototype.compareTo = bnCompareTo;
BigInteger.prototype.bitLength = bnBitLength;
BigInteger.prototype.mod = bnMod;
BigInteger.prototype.modPowInt = bnModPowInt;
// "??"
BigInteger.ZERO = nbv(0);
BigInteger.ONE = nbv(1);
#文件prng4.js
// prng4.js - Arcfour? PRNG
??? ?? Arcfour() {
this.i = 0;
this.j = 0;
this.S = new Array();
}
// ?? [0..255]? ?? ??? ??? arcfour ????? ??????.
function ARC4init(key) {
var i, j, t;
for(i = 0; i < 256; i)
this.S[i] = i;
j = 0;
for(i = 0; i < 256; i) {
j = (j this.S[i] key[i % key.length]) & 255;
t = this.S[i];
this.S[i] = this.S[j];
this.S[j] = t;
}
this.i = 0;
this.j = 0;
}
function ARC4next() {
var t;
this.i = (this.i 1) & 255;
this.j = (this.j this.S[this.i]) & 255;
t = this.S[this.i];
this.S[this.i] = this.S[this.j];
this.S[this.j] = t;
return this.S[(t this.S[this.i]) & 255];
}
Arcfour.prototype.init = ARC4init;
Arcfour.prototype.next = ARC4next;
// ??? RNG ???? ?????.
function prng_newstate() {
return new Arcfour();
}
// ? ??? 4? ???? 32?? ?? ???.
// ? ??? ??? ??? init()? ?????.
var rng_psize = 256 ;
文件:rng.js
// ?? ??? - PRNG ???? ?????. prng4.js
// ??? ??? ????
// // ?? ?? ??
$public = (int) Expect($raw[$i], "publicExpont: ");
// ?? ?? ??
expect($raw[$i 1], "privateExComponent:");
for($i = 2; $raw[$i][0] == ' '; $i ) $privateRaw .= ??($raw[$i]);
//
expect($raw[$i], "prime1:");
// bcmath? 10?? ???? ??
$modulus = bc_hexdec($modulusRaw);
$private = bc_hexdec($privateRaw);
?? ??($keylength, $modulus['php'], $public, $private['php'],$modulus['js'], $private['js']);
}
/*
* "XX:YY:ZZ:..." ??? 16??? 10??? ??
* BCmath? ????? ?? ??? ?? ?? ?? 16?? ??
*/
?? bc_hexdec($hex)
{
$coefficients =Explode(":", $hex);
$result_js= implode("",$coefficients);
$i = 0;
$?? = 0;
foreach(array_reverse($coefficients) as $coefficient)
{
$mult = bcpow(256, $i );
$result = bcadd($result, bcmul(hexdec($coefficient), $mult));
}
return array('php'=>$result,'js'=>$result_js);
}
/*
* ???? ??? ???? ??? ???? ?????.
* ??? ??? ??? ???? ????.
*/
function Expect($str, $prefix)
{
if(substr($str, 0, strlen($prefix)) == $prefix)
return substr($str, strlen($prefix));
else
die("??: $prefix ??");
}

整套加密及解密???? 本人?測(cè)試環(huán)境為php5.3 WIN7
??所有文件下載:RSAFILE

以上就介紹了數(shù)據(jù)加密 PHP JS rsa數(shù)據(jù)加密傳輸實(shí)現(xiàn)代碼, 包括了數(shù)據(jù)加密方了內(nèi)容, 希望對(duì)PHP教程興趣的朋友有所幫助。