我用Python逆向登录世界上最大的游戏平台，steam加密手段有多高明【内附源码】(1)

本文链接：https://blog.csdn.net/2401_84538391/article/details/138782999

学好 Python 不论是就业还是做副业赚钱都不错，但要学会 Python 还是要有一个学习规划。最后大家分享一份全套的 Python 学习资料，给那些想学习 Python 的小伙伴们一点帮助！

一、Python所有方向的学习路线

Python所有方向路线就是把Python常用的技术点做整理，形成各个领域的知识点汇总，它的用处就在于，你可以按照上面的知识点去找对应的学习资源，保证自己学得较为全面。

二、学习软件

工欲善其事必先利其器。学习Python常用的开发软件都在这里了，给大家节省了很多时间。

三、全套PDF电子书

书籍的好处就在于权威和体系健全，刚开始学习的时候你可以只看视频或者听某个人讲课，但等你学完之后，你觉得你掌握了，这时候建议还是得去看一下书籍，看权威技术书籍也是每个程序员必经之路。

四、入门学习视频

我们在看视频学习的时候，不能光动眼动脑不动手，比较科学的学习方法是在理解之后运用它们，这时候练手项目就很适合了。

五、实战案例

光学理论是没用的，要学会跟着一起敲，要动手实操，才能将自己的所学运用到实际当中去，这时候可以搞点实战案例来学习。

六、面试资料

我们学习Python必然是为了找到高薪的工作，下面这些面试题是来自阿里、腾讯、字节等一线互联网大厂最新的面试资料，并且有阿里大佬给出了权威的解答，刷完这一套面试资料相信大家都能找到满意的工作。

网上学习资料一大堆，但如果学到的知识不成体系，遇到问题时只是浅尝辄止，不再深入研究，那么很难做到真正的技术提升。

需要这份系统化学习资料的朋友，可以戳这里获取

一个人可以走的很快，但一群人才能走的更远！不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人，都欢迎加入我们的的圈子（技术交流、学习资源、职场吐槽、大厂内推、面试辅导），让我们一起学习成长！

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®; this.reduce®; }

// r = “xy/R mod m”; x,y != r

function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce®; }

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

while(–i >= 0) {

z.sqrTo(r,r2);

if((e&(1<<i)) > 0) z.mulTo(r2,g,r);

else { var t = r; r = r2; r2 = t; }

}

return z.revert®;

}

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

// See “LICENSE” for details.

// Extended JavaScript BN functions, required for RSA private ops.

// (public)

function bnClone() { var r = nbi(); this.copyTo®; return r; }

// (public) return value as integer

function bnIntValue() {

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;

// assumes 16 < DB < 32

return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];

}

// (public) return value as byte

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

// (public) return value as short (assumes DB>=16)

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

// (protected) return x s.t. r^x < DV

function bnpChunkSize® { return Math.floor(Math.LN2*this.DB/Math.log®); }

// (public) 0 if this == 0, 1 if this > 0

function bnSigNum() {

if(this.s < 0) return -1;

else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;

else return 1;

}

// (protected) convert to radix string

function bnpToRadix(b) {

if(b == null) b = 10;

if(this.signum() == 0 || b < 2 || b > 36) return “0”;

var cs = this.chunkSize(b);

var a = Math.pow(b,cs);

var d = nbv(a), y = nbi(), z = nbi(), r = “”;

this.divRemTo(d,y,z);

while(y.signum() > 0) {

r = (a+z.intValue()).toString(b).substr(1) + r;

y.divRemTo(d,y,z);

}

return z.intValue().toString(b) + r;

}

// (protected) convert from radix string

function bnpFromRadix(s,b) {

this.fromInt(0);

if(b == null) b = 10;

var cs = this.chunkSize(b);

var d = Math.pow(b,cs), mi = false, j = 0, w = 0;

for(var i = 0; i < s.length; ++i) {

var x = intAt(s,i);

if(x < 0) {

if(s.charAt(i) == “-” && this.signum() == 0) mi = true;

continue;

}

w = b*w+x;

if(++j >= cs) {

this.dMultiply(d);

this.dAddOffset(w,0);

j = 0;

w = 0;

}

if(j > 0) {

this.dMultiply(Math.pow(b,j));

this.dAddOffset(w,0);

}

if(mi) BigInteger.ZERO.subTo(this,this);

}

// (protected) alternate constructor

function bnpFromNumber(a,b,c) {

if(“number” == typeof b) {

// new BigInteger(int,int,RNG)

if(a < 2) this.fromInt(1);

else {

this.fromNumber(a,c);

if(!this.testBit(a-1)) // force MSB set

this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);

if(this.isEven()) this.dAddOffset(1,0); // force odd

while(!this.isProbablePrime(b)) {

this.dAddOffset(2,0);

if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);

}

else {

// new BigInteger(int,RNG)

var x = new Array(), t = a&7;

x.length = (a>>3)+1;

b.nextBytes(x);

if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;

this.fromString(x,256);

}

// (public) convert to bigendian byte array

function bnToByteArray() {

var i = this.t, r = new Array();

r[0] = this.s;

var p = this.DB-(i*this.DB)%8, d, k = 0;

if(i-- > 0) {

if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)

r[k++] = d|(this.s<<(this.DB-p));

while(i >= 0) {

if(p < 8) {

d = (this[i]&((1<<p)-1))<<(8-p);

d |= this[–i]>>(p+=this.DB-8);

}

else {

d = (this[i]>>(p-=8))&0xff;

if(p <= 0) { p += this.DB; --i; }

}

if((d&0x80) != 0) d |= -256;

if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;

if(k > 0 || d != this.s) r[k++] = d;

}

return r;

}

function bnEquals(a) { return(this.compareTo(a)==0); }

function bnMin(a) { return(this.compareTo(a)<0)?this:a; }

function bnMax(a) { return(this.compareTo(a)>0)?this:a; }

// (protected) r = this op a (bitwise)

function bnpBitwiseTo(a,op,r) {

var i, f, m = Math.min(a.t,this.t);

for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);

if(a.t < this.t) {

f = a.s&this.DM;

for(i = m; i < this.t; ++i) r[i] = op(this[i],f);

r.t = this.t;

}

else {

f = this.s&this.DM;

for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);

r.t = a.t;

}

r.s = op(this.s,a.s);

r.clamp();

}

// (public) this & a

function op_and(x,y) { return x&y; }

function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }

// (public) this | a

function op_or(x,y) { return x|y; }

function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }

// (public) this ^ a

function op_xor(x,y) { return x^y; }

function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }

// (public) this & ~a

function op_andnot(x,y) { return x&~y; }

function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }

// (public) ~this

function bnNot() {

var r = nbi();

for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];

r.t = this.t;

r.s = ~this.s;

return r;

}

// (public) this << n

function bnShiftLeft(n) {

var r = nbi();

if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);

return r;

}

// (public) this >> n

function bnShiftRight(n) {

var r = nbi();

if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);

return r;

}

// return index of lowest 1-bit in x, x < 2^31

function lbit(x) {

if(x == 0) return -1;

var r = 0;

if((x&0xffff) == 0) { x >>= 16; r += 16; }

if((x&0xff) == 0) { x >>= 8; r += 8; }

if((x&0xf) == 0) { x >>= 4; r += 4; }

if((x&3) == 0) { x >>= 2; r += 2; }

if((x&1) == 0) ++r;

return r;

}

// (public) returns index of lowest 1-bit (or -1 if none)

function bnGetLowestSetBit() {

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

if(this[i] != 0) return i*this.DB+lbit(this[i]);

if(this.s < 0) return this.t*this.DB;

return -1;

}

// return number of 1 bits in x

function cbit(x) {

var r = 0;

while(x != 0) { x &= x-1; ++r; }

return r;

}

// (public) return number of set bits

function bnBitCount() {

var r = 0, x = this.s&this.DM;

for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);

return r;

}

// (public) true iff nth bit is set

function bnTestBit(n) {

var j = Math.floor(n/this.DB);

if(j >= this.t) return(this.s!=0);

return((this[j]&(1<<(n%this.DB)))!=0);

}

// (protected) this op (1<<n)

function bnpChangeBit(n,op) {

var r = BigInteger.ONE.shiftLeft(n);

this.bitwiseTo(r,op,r);

return r;

}

// (public) this | (1<<n)

function bnSetBit(n) { return this.changeBit(n,op_or); }

// (public) this & ~(1<<n)

function bnClearBit(n) { return this.changeBit(n,op_andnot); }

// (public) this ^ (1<<n)

function bnFlipBit(n) { return this.changeBit(n,op_xor); }

// (protected) r = this + a

function bnpAddTo(a,r) {

var i = 0, c = 0, m = Math.min(a.t,this.t);

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 > 0) r[i++] = c;

else if(c < -1) r[i++] = this.DV+c;

r.t = i;

r.clamp();

}

// (public) this + a

function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }

// (public) this - a

function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }

// (public) this * a

function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }

// (public) this / a

function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }

// (public) this % a

function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }

// (public) [this/a,this%a]

function bnDivideAndRemainder(a) {

var q = nbi(), r = nbi();

this.divRemTo(a,q,r);

return new Array(q,r);

}

// (protected) this *= n, this >= 0, 1 < n < DV

function bnpDMultiply(n) {

this[this.t] = this.am(0,n-1,this,0,0,this.t);

++this.t;

this.clamp();

}

// (protected) this += n << w words, this >= 0

function bnpDAddOffset(n,w) {

while(this.t <= w) this[this.t++] = 0;

this[w] += n;

while(this[w] >= this.DV) {

this[w] -= this.DV;

if(++w >= this.t) this[this.t++] = 0;

++this[w];

}

// A “null” reducer

function NullExp() {}

function nNop(x) { return x; }

function nMulTo(x,y,r) { x.multiplyTo(y,r); }

function nSqrTo(x,r) { x.squareTo®; }

NullExp.prototype.convert = nNop;

NullExp.prototype.revert = nNop;

NullExp.prototype.mulTo = nMulTo;

NullExp.prototype.sqrTo = nSqrTo;

// (public) this^e

function bnPow(e) { return this.exp(e,new NullExp()); }

// (protected) r = lower n words of “this * a”, a.t <= n

// “this” should be the larger one if appropriate.

function bnpMultiplyLowerTo(a,n,r) {

var i = Math.min(this.t+a.t,n);

r.s = 0; // assumes a,this >= 0

r.t = i;

while(i > 0) r[–i] = 0;

var j;

for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);

for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);

r.clamp();

}

// (protected) r = “this * a” without lower n words, n > 0

// “this” should be the larger one if appropriate.

function bnpMultiplyUpperTo(a,n,r) {

–n;

var i = r.t = this.t+a.t-n;

r.s = 0; // assumes a,this >= 0

while(–i >= 0) r[i] = 0;

for(i = Math.max(n-this.t,0); i < a.t; ++i)

r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);

r.clamp();

r.drShiftTo(1,r);

}

// Barrett modular reduction

function Barrett(m) {

// setup Barrett

this.r2 = nbi();

this.q3 = nbi();

BigInteger.ONE.dlShiftTo(2*m.t,this.r2);

this.mu = this.r2.divide(m);

this.m = m;

}

function barrettConvert(x) {

if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);

else if(x.compareTo(this.m) < 0) return x;

else { var r = nbi(); x.copyTo®; this.reduce®; return r; }

}

function barrettRevert(x) { return x; }

// x = x mod m (HAC 14.42)

function barrettReduce(x) {

x.drShiftTo(this.m.t-1,this.r2);

if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }

this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);

this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);

while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);

x.subTo(this.r2,x);

while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);

}

// r = x^2 mod m; x != r

function barrettSqrTo(x,r) { x.squareTo®; this.reduce®; }

// r = x*y mod m; x,y != r

function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce®; }

Barrett.prototype.convert = barrettConvert;

Barrett.prototype.revert = barrettRevert;

Barrett.prototype.reduce = barrettReduce;

Barrett.prototype.mulTo = barrettMulTo;

Barrett.prototype.sqrTo = barrettSqrTo;

// (public) this^e % m (HAC 14.85)

function bnModPow(e,m) {

var i = e.bitLength(), k, r = nbv(1), z;

if(i <= 0) return r;

else if(i < 18) k = 1;

else if(i < 48) k = 3;

else if(i < 144) k = 4;

else if(i < 768) k = 5;

else k = 6;

if(i < 8)

z = new Classic(m);

else if(m.isEven())

z = new Barrett(m);

else

z = new Montgomery(m);

// precomputation

var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;

g[1] = z.convert(this);

if(k > 1) {

var g2 = nbi();

z.sqrTo(g[1],g2);

while(n <= km) {

g[n] = nbi();

z.mulTo(g2,g[n-2],g[n]);

n += 2;

}

var j = e.t-1, w, is1 = true, r2 = nbi(), t;

i = nbits(e[j])-1;

while(j >= 0) {

if(i >= k1) w = (e[j]>>(i-k1))&km;

else {

w = (e[j]&((1<<(i+1))-1))<<(k1-i);

if(j > 0) w |= e[j-1]>>(this.DB+i-k1);

}

n = k;

while((w&1) == 0) { w >>= 1; --n; }

if((i -= n) < 0) { i += this.DB; --j; }

if(is1) { // ret == 1, don’t bother squaring or multiplying it

g[w].copyTo®;

is1 = false;

}

else {

while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }

if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }

z.mulTo(r2,g[w],r);

}

while(j >= 0 && (e[j]&(1<<i)) == 0) {

z.sqrTo(r,r2); t = r; r = r2; r2 = t;

if(–i < 0) { i = this.DB-1; --j; }

}

return z.revert®;

}

// (public) gcd(this,a) (HAC 14.54)

function bnGCD(a) {

var x = (this.s<0)?this.negate():this.clone();

var y = (a.s<0)?a.negate():a.clone();

if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }

var i = x.getLowestSetBit(), g = y.getLowestSetBit();

if(g < 0) return x;

if(i < g) g = i;

if(g > 0) {

x.rShiftTo(g,x);

y.rShiftTo(g,y);

}

while(x.signum() > 0) {

if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);

if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);

if(x.compareTo(y) >= 0) {

x.subTo(y,x);

x.rShiftTo(1,x);

}

else {

y.subTo(x,y);

y.rShiftTo(1,y);

}

if(g > 0) y.lShiftTo(g,y);

return y;

}

// (protected) this % n, n < 2^26

function bnpModInt(n) {

if(n <= 0) return 0;

var d = this.DV%n, r = (this.s<0)?n-1:0;

if(this.t > 0)

if(d == 0) r = this[0]%n;

else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;

return r;

}

// (public) 1/this % m (HAC 14.61)

function bnModInverse(m) {

var ac = m.isEven();

if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;

var u = m.clone(), v = this.clone();

var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);

while(u.signum() != 0) {

while(u.isEven()) {

u.rShiftTo(1,u);

if(ac) {

if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }

a.rShiftTo(1,a);

}

else if(!b.isEven()) b.subTo(m,b);

b.rShiftTo(1,b);

}

while(v.isEven()) {

v.rShiftTo(1,v);

if(ac) {

if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }

c.rShiftTo(1,c);

}

else if(!d.isEven()) d.subTo(m,d);

d.rShiftTo(1,d);

}

if(u.compareTo(v) >= 0) {

u.subTo(v,u);

if(ac) a.subTo(c,a);

b.subTo(d,b);

}

else {

v.subTo(u,v);

if(ac) c.subTo(a,c);

d.subTo(b,d);

}

if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;

if(d.compareTo(m) >= 0) return d.subtract(m);

if(d.signum() < 0) d.addTo(m,d); else return d;

if(d.signum() < 0) return d.add(m); else return d;

}

var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509];

var lplim = (1<<26)/lowprimes[lowprimes.length-1];

// (public) test primality with certainty >= 1-.5^t

function bnIsProbablePrime(t) {

var i, x = this.abs();

if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {

for(i = 0; i < lowprimes.length; ++i)

if(x[0] == lowprimes[i]) return true;

return false;

}

if(x.isEven()) return false;

i = 1;

while(i < lowprimes.length) {

var m = lowprimes[i], j = i+1;

while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];

m = x.modInt(m);

while(i < j) if(m%lowprimes[i++] == 0) return false;

}

return x.millerRabin(t);

}

// (protected) true if probably prime (HAC 4.24, Miller-Rabin)

function bnpMillerRabin(t) {

var n1 = this.subtract(BigInteger.ONE);

var k = n1.getLowestSetBit();

if(k <= 0) return false;

var r = n1.shiftRight(k);

t = (t+1)>>1;

if(t > lowprimes.length) t = lowprimes.length;

var a = nbi();

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

a.fromInt(lowprimes[i]);

var y = a.modPow(r,this);

if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {

var j = 1;

while(j++ < k && y.compareTo(n1) != 0) {

y = y.modPowInt(2,this);

if(y.compareTo(BigInteger.ONE) == 0) return false;

}

if(y.compareTo(n1) != 0) return false;

}

return true;

}

// protected

BigInteger.prototype.chunkSize = bnpChunkSize;

BigInteger.prototype.toRadix = bnpToRadix;

BigInteger.prototype.fromRadix = bnpFromRadix;

BigInteger.prototype.fromNumber = bnpFromNumber;

BigInteger.prototype.bitwiseTo = bnpBitwiseTo;

BigInteger.prototype.changeBit = bnpChangeBit;

BigInteger.prototype.addTo = bnpAddTo;

BigInteger.prototype.dMultiply = bnpDMultiply;

BigInteger.prototype.dAddOffset = bnpDAddOffset;

BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;

BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;

BigInteger.prototype.modInt = bnpModInt;

BigInteger.prototype.millerRabin = bnpMillerRabin;

// public

BigInteger.prototype.clone = bnClone;

BigInteger.prototype.intValue = bnIntValue;

BigInteger.prototype.byteValue = bnByteValue;

BigInteger.prototype.shortValue = bnShortValue;

BigInteger.prototype.signum = bnSigNum;

BigInteger.prototype.toByteArray = bnToByteArray;

BigInteger.prototype.equals = bnEquals;

BigInteger.prototype.min = bnMin;

BigInteger.prototype.max = bnMax;

BigInteger.prototype.and = bnAnd;

BigInteger.prototype.or = bnOr;

BigInteger.prototype.xor = bnXor;

BigInteger.prototype.andNot = bnAndNot;

BigInteger.prototype.not = bnNot;

BigInteger.prototype.shiftLeft = bnShiftLeft;

BigInteger.prototype.shiftRight = bnShiftRight;

BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;

BigInteger.prototype.bitCount = bnBitCount;

BigInteger.prototype.testBit = bnTestBit;

BigInteger.prototype.setBit = bnSetBit;

BigInteger.prototype.clearBit = bnClearBit;

BigInteger.prototype.flipBit = bnFlipBit;

BigInteger.prototype.add = bnAdd;

BigInteger.prototype.subtract = bnSubtract;

BigInteger.prototype.multiply = bnMultiply;

BigInteger.prototype.divide = bnDivide;

BigInteger.prototype.remainder = bnRemainder;

BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;

BigInteger.prototype.modPow = bnModPow;

BigInteger.prototype.modInverse = bnModInverse;

BigInteger.prototype.pow = bnPow;

BigInteger.prototype.gcd = bnGCD;

BigInteger.prototype.isProbablePrime = bnIsProbablePrime;

// BigInteger interfaces not implemented in jsbn:

// BigInteger(int signum, byte[] magnitude)

// double doubleValue()

// float floatValue()

// int hashCode()

// long longValue()

// static BigInteger valueOf(long val)

var RSAPublicKey = function($modulus_hex, $encryptionExponent_hex) {

this.modulus = new BigInteger( $modulus_hex, 16);

this.encryptionExponent = new BigInteger( $encryptionExponent_hex, 16);

};

var Base64 = {

base64: “ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=”,

encode: function($input) {

if (!$input) {

return false;

}

var $output = “”;

var $chr1, $chr2, $chr3;

var $enc1, $enc2, $enc3, $enc4;

var $i = 0;

do {

$chr1 = $in p u t . c ha r C o d e A t ($ i++);

$chr2 = $in p u t . c ha r C o d e A t ($ i++);

$chr3 = $in p u t . c ha r C o d e A t ($ i++);

$enc1 = $chr1 >> 2;

$e n c 2 = (($ chr1 & 3) << 4) | ($chr2 >> 4);

$e n c 3 = (($ chr2 & 15) << 2) | ($chr3 >> 6);

$enc4 = $chr3 & 63;

if (isNaN($chr2)) $enc3 = $enc4 = 64;

else if (isNaN($chr3)) $enc4 = 64;

$o u tp u t + = t hi s . ba se 64. c ha r A t ($ enc1) + this.base64.charAt( $e n c 2) + t hi s . ba se 64. c ha r A t ($ enc3) + this.base64.charAt($enc4);

} while ($i < $input.length);

return $output;

decode: function($input) {

if(!$input) return false;

$input = $input.replace(/[^A-Za-z0-9+/=]/g, “”);

var $output = “”;

var $enc1, $enc2, $enc3, $enc4;

var $i = 0;

do {

$e n c 1 = t hi s . ba se 64. in d e x O f ($ input.charAt($i++));

$e n c 2 = t hi s . ba se 64. in d e x O f ($ input.charAt($i++));

$e n c 3 = t hi s . ba se 64. in d e x O f ($ input.charAt($i++));

$e n c 4 = t hi s . ba se 64. in d e x O f ($ input.charAt($i++));

$o u tp u t + = St r in g . f ro m C ha r C o d e (($ enc1 << 2) | ($enc2 >> 4));

if ($enc3 != 64) $o u tp u t + = St r in g . f ro m C ha r C o d e ((($ enc2 & 15) << 4) | ($enc3 >> 2));

if ($enc4 != 64) $o u tp u t + = St r in g . f ro m C ha r C o d e ((($ enc3 & 3) << 6) | $enc4);

} while ($i < $input.length);

return $output;

}

};

var Hex = {

hex: “0123456789abcdef”,

encode: function($input) {

if(!$input) return false;

var $output = “”;

var $k;

var $i = 0;

do {

$k = $in p u t . c ha r C o d e A t ($ i++);

$o u tp u t + = t hi s . h e x . c ha r A t (($ k >> 4) &0xf) + this.hex.charAt($k & 0xf);

} while ($i < $input.length);

return $output;

decode: function($input) {

if(!$input) return false;

$input = $input.replace(/[^0-9abcdef]/g, “”);

var $output = “”;

var $i = 0;

do {

$o u tp u t + = St r in g . f ro m C ha r C o d e (((t hi s . h e x . in d e x O f ($ input.charAt( $KaTeX parse error: Expected 'EOF', got '&' at position 13: i++)) << 4) &̲ 0xf0) | (this.\dots$ input.charAt($i++)) & 0xf));

} while ($i < $input.length);

return $output;

}

};

var RSA = {

getPublicKey: function( $modulus_hex, $exponent_hex ) {

return new RSAPublicKey( $modulus_hex, $exponent_hex );

encrypt: function($data, $pubkey) {

if (!$pubkey) return false;

$d a t a = t hi s . p k cs 1 p a d 2 ($ data,($pubkey.modulus.bitLength()+7)>>3);

if(!$data) return false;

$data = $d a t a . m o d P o w I n t ($ pubkey.encryptionExponent, $pubkey.modulus);

if(!$data) return false;

$data = $data.toString(16);

if(($data.length & 1) == 1)

$data = “0” + $data;

return Base64.encode(Hex.decode($data));

pkcs1pad2: function($data, $keysize) {

if($keysize < $data.length + 11)

return null;

var $buffer = [];

var $i = $data.length - 1;

while($i >= 0 && $keysize > 0)

$b u ff er [- -$ keysize] = $d a t a . c ha r C o d e A t ($ i–);

$b u ff er [- -$ keysize] = 0;

while($keysize > 2)

$b u ff er [- -$ keysize] = Math.floor(Math.random()*254) + 1;

$b u ff er [- -$ keysize] = 2;

$b u ff er [- -$ keysize] = 0;

return new BigInteger($buffer);

}

};

OnAuthCodeResponse = function(results, password) {

// var form = this.m_$LogonForm[0];

var pubKey = RSA.getPublicKey(results.publickey_mod, results.publickey_exp);

// var username = this.m_strUsernameCanonical;

// var password = form.elements[‘password’].value;

password = password.replace(/[^\x00-\x7F]/g, ‘’);

// remove non-standard-ASCII characters

var encryptedPassword = RSA.encrypt(password, pubKey);

return encryptedPassword

};

console.log(OnAuthCodeResponse({‘success’: ‘True’, ‘publickey_mod’: ‘aef25caaaba051405eb6be0ee34e927aa7378248279345a5c9cdb4f873de605e81167608b3f8592b7692d592373dae0b3b8e878dbcb3c25dda0d83d8b0b5e5432e59d33210749537f596841b7bd989594e6109d2ab63aed23052b0667de72c22e64f2e09a55066bf861bcf24f79336e75caff55887409c695bdf232d846b9e73a89a2df20a28fb580a504188f4a9e16e759e7aa5f454ce6e03aebf998cbc6ed478c24069af6ee8e06954fb9748bc387d811bfb33bc8d00b5400134bcbb8e872be4e8e60924754c10c522539dd1feeebc71f36c3f1d0484a914b8cbfb9966b403923d98821f02de5ec5d3ffba0b022dbf7cbfcec3fb88278bee580fe8f40960f9’, ‘publickey_exp’: ‘010001’, ‘timestamp’: ‘133267600000’, ‘token_gid’: ‘27ddf868c7def6b4’}, ‘12345’))

// Gq8LwJWnpwJS438pSVx7qnOW0gGGAv7gZbZKmbQtVcww4wVqck0FPUYScf8IyBz7DIbNawHVrx4lShLCS2oOPqxKNV6IybKESkARGXV4TqiVHF36oXejbO89zFWop5JDBeZl1nbV2y99fbSqAx2P/oxt3lm33xebkwc42KJqK1sAHK+dZ8YVT1Ji9J3JNeTVZvoH/4I5oRkb2ai5DsURllQkGvut3b9eGx6MSumCTp0YCVGjE4oE9WSq8Gvq7sD7F8QNobfRGUKk1TvcYmeqwDtSTGQWascbAic7+/yKV0ej2AyHyIQ/nnUMWjI4HWDRAqxyAHKkB6mPFLKKJZiQLQ==

简易源码分享

import time

import execjs

import requests

login_url = ‘https://store.steampowered.com/login/dologin/’

get_rsa_key_url = ‘https://store.steampowered.com/login/getrsakey/’

headers = {

‘Host’: ‘store.steampowered.com’,

‘Origin’: ‘https://store.steampowered.com’,

‘Referer’: ‘https://store.steampowered.com/login/?redir=&redir_ssl=1&snr=1_4_4__global-header’,

‘User-Agent’: ‘Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.124 Safari/537.36Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/94.0.4606.71 Safari/537.36’

}

session = requests.session()

def get_rsa_key(username):

data = {

‘donotcache’: str(int(time.time() * 1000)),

‘username’: username

}

response = session.post(url=get_rsa_key_url, data=data, headers=headers).json()

print(response)

return response

def get_encrypted_password(password, rsa_key_dict):

f = open(‘steam.js’, ‘r’, encoding=‘utf-8’)