PHP与js的数据加密传输,PHP+JS+rsa数据加密传输实现代码_PHP教程

var 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); // "negative" y so we can replace sub with am later

while(y.t < ys) y[y.t++] = 0;

while(--j >= 0) {

// Estimate quotient digit

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) { // Try it out

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); // Denormalize remainder

if(ts < 0) BigInteger.ZERO.subTo(r,r);

}

// (public) this mod 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);

return r;

}

// Modular reduction using "classic" algorithm

function Classic(m) { this.m = m; }

function cConvert(x) {

if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);

else return 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;

// (protected) return "-1/this % 2^DB"; useful for Mont. reduction

// justification:

// xy == 1 (mod m)

// xy = 1+km

// xy(2-xy) = (1+km)(1-km)

// x[y(2-xy)] = 1-k^2m^2

// x[y(2-xy)] == 1 (mod m^2)

// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2

// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.

// JS multiply "overflows" differently from C/C++, so care is needed here.

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

// last step - calculate inverse mod DV directly;

// assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints

y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits

// we really want the negative inverse, and -DV < y < DV

return (y>0)?this.DV-y:-y;

}

// Montgomery reduction

function Montgomery(m) {

this.m = m;

this.mp = m.invDigit();

this.mpl = this.mp&0x7fff;

this.mph = this.mp>>15;

this.um = (1

}

// 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 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);

return r;

}

// x/R mod m

function montRevert(x) {

var r = nbi();

x.copyTo(r);

this.reduce(r);

return r;

}

// x = x/R mod m (HAC 14.32)

function montReduce(x) {

while(x.t <= this.mt2) // pad x so am has enough room later

x[x.t++] = 0;

for(var i = 0; i < this.m.t; ++i) {

// faster way of calculating 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;

// use am to combine the multiply-shift-add into one call

j = i+this.m.t;

x[j] += this.m.am(0,u0,x,i,0,this.m.t);

// propagate carry

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 mod 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;

// (protected) true iff this is even

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

// (protected) this^e, e < 2^32, doing sqr and mul with "r" (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 = t; }

}

return z.revert(r);

}

// (public) this^e % m, 0 <= e < 2^32

function bnModPowInt(e,m) {

var z;

if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);

return this.exp(e,z);

}

// protected

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;

// public

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;

// "constants"

BigInteger.ZERO = nbv(0);

BigInteger.ONE = nbv(1);

#文件prng4.js

// prng4.js - uses Arcfour as a PRNG

function Arcfour() {

this.i = 0;

this.j = 0;

this.S = new Array();

}

// Initialize arcfour context from key, an array of ints, each from [0..255]

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;

// Plug in your RNG constructor here

function prng_newstate() {

return new Arcfour();

}

// Pool size must be a multiple of 4 and greater than 32.

// An array of bytes the size of the pool will be passed to init()

var rng_psize = 256;

文件:rng.js

// Random number generator - requires a PRNG backend, e.g. prng4.js

// For best results, put code like

//

// in your main HTML document.

var rng_state;

var rng_pool;

var rng_pptr;

// Mix in a 32-bit integer into the pool

function rng_seed_int(x) {

rng_pool[rng_pptr++] ^= x & 255;

rng_pool[rng_pptr++] ^= (x >> 8) & 255;

rng_pool[rng_pptr++] ^= (x >> 16) & 255;

rng_pool[rng_pptr++] ^= (x >> 24) & 255;

if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;

}

// Mix in the current time (w/milliseconds) into the pool

function rng_seed_time() {

rng_seed_int(new Date().getTime());

}

// Initialize the pool with junk if needed.

if(rng_pool == null) {

rng_pool = new Array();

rng_pptr = 0;

var t;

if(navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {

// Extract entropy (256 bits) from NS4 RNG if available

var z = window.crypto.random(32);

for(t = 0; t < z.length; ++t)

rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;

}

while(rng_pptr < rng_psize) { // extract some randomness from Math.random()

t = Math.floor(65536 * Math.random());

rng_pool[rng_pptr++] = t >>> 8;

rng_pool[rng_pptr++] = t & 255;

}

rng_pptr = 0;

rng_seed_time();

//rng_seed_int(window.screenX);

//rng_seed_int(window.screenY);

}

function rng_get_byte() {

if(rng_state == null) {

rng_seed_time();

rng_state = prng_newstate();

rng_state.init(rng_pool);

for(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)

rng_pool[rng_pptr] = 0;

rng_pptr = 0;

//rng_pool = null;

}

// TODO: allow reseeding after first request

return rng_state.next();

}

function rng_get_bytes(ba) {

var i;

for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();

}

function SecureRandom() {}

SecureRandom.prototype.nextBytes = rng_get_bytes;

#文件:rsa.js

// Depends on jsbn.js and rng.js

// Version 1.1: support utf-8 encoding in pkcs1pad2

// convert a (hex) string to a bignum object

function parseBigInt(str,r) {

return new BigInteger(str,r);

}

function linebrk(s,n) {

var ret = "";

var i = 0;

while(i + n < s.length) {

ret += s.substring(i,i+n) + "\n";

i += n;

}

return ret + s.substring(i,s.length);

}

function byte2Hex(b) {

if(b < 0x10)

return "0" + b.toString(16);

else

return b.toString(16);

}

// PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint

function pkcs1pad2(s,n) {

if(n < s.length + 11) { // TODO: fix for utf-8

alert("Message too long for RSA");

return null;

}

var ba = new Array();

var i = s.length - 1;

while(i >= 0 && n > 0) {

var c = s.charCodeAt(i--);

if(c < 128) { // encode using utf-8

ba[--n] = c;

}

else if((c > 127) && (c < 2048)) {

ba[--n] = (c & 63) | 128;

ba[--n] = (c >> 6) | 192;

}

else {

ba[--n] = (c & 63) | 128;

ba[--n] = ((c >> 6) & 63) | 128;

ba[--n] = (c >> 12) | 224;

}

}

ba[--n] = 0;

var rng = new SecureRandom();

var x = new Array();

while(n > 2) { // random non-zero pad

x[0] = 0;

while(x[0] == 0) rng.nextBytes(x);

ba[--n] = x[0];

}

ba[--n] = 2;

ba[--n] = 0;

return new BigInteger(ba);

}

// "empty" RSA key constructor

function RSAKey() {

this.n = null;

this.e = 0;

this.d = null;

this.p = null;

this.q = null;

this.dmp1 = null;

this.dmq1 = null;

this.coeff = null;

}

// Set the public key fields N and e from hex strings

function RSASetPublic(N,E) {

if(N != null && E != null && N.length > 0 && E.length > 0) {

this.n = parseBigInt(N,16);

this.e = parseInt(E,16);

}

else

alert("Invalid RSA public key");

}

// Perform raw public operation on "x": return x^e (mod n)

function RSADoPublic(x) {

return x.modPowInt(this.e, this.n);

}

// Return the PKCS#1 RSA encryption of "text" as an even-length hex string

function RSAEncrypt(text) {

var m = pkcs1pad2(text,(this.n.bitLength()+7)>>3);

if(m == null) return null;

var c = this.doPublic(m);

if(c == null) return null;

var h = c.toString(16);

if((h.length & 1) == 0) return h; else return "0" + h;

}

// Return the PKCS#1 RSA encryption of "text" as a Base64-encoded string

//function RSAEncryptB64(text) {

// var h = this.encrypt(text);

// if(h) return hex2b64(h); else return null;

//}

// protected

RSAKey.prototype.doPublic = RSADoPublic;

// public

RSAKey.prototype.setPublic = RSASetPublic;

RSAKey.prototype.encrypt = RSAEncrypt;

//RSAKey.prototype.encrypt_b64 = RSAEncryptB64;