1. // uid: 187735109041
    2. // pwd: 885f548d61efbc0badd2b8605e2a426808b583f47b09c1edf514dae8608a6c10b5ec4fecba504ef0603d1e96cca2d19d334b2fbfec3c50fd708fe9a7af90c9a0777369341e608973b45125e7044b819ab50c4be8624228466615f4e657ff80bb697013c88b71ab711a653261df5830c4c2c4b6911f89c79f141ae81468008804
    3. // Service: soufun-passport-web
    4. // AutoLogin: 1
    5. // pwd = encryptedString(key_to_encode, that.password.val()),
    6. function setMaxDigits(n) {
    7.     maxDigits = n;
    8.     ZERO_ARRAY = new Array(maxDigits);
    9.     for (var t = 0; t < ZERO_ARRAY.length; t++)
    10.         ZERO_ARRAY[t] = 0;
    11.     bigZero = new BigInt;
    12.     bigOne = new BigInt;
    13.     bigOne.digits[0] = 1
    14. }
    15. function BigInt(n) {
    16.     this.digits = typeof n == "boolean" && n == !0 ? null : ZERO_ARRAY.slice(0);
    17.     this.isNeg = !1
    18. }
    19. function biFromDecimal(n) {
    20.     for (var u = n.charAt(0) == "-", t = u ? 1 : 0, i, f, r; t < n.length && n.charAt(t) == "0"; )
    21.         ++t;
    22.     if (t == n.length)
    23.         i = new BigInt;
    24.     else {
    25.         for (f = n.length - t,
    26.         r = f % dpl10,
    27.         r == 0 && (r = dpl10),
    28.         i = biFromNumber(Number(n.substr(t, r))),
    29.         t += r; t < n.length; )
    30.             i = biAdd(biMultiply(i, lr10), biFromNumber(Number(n.substr(t, dpl10)))),
    31.             t += dpl10;
    32.         i.isNeg = u
    33.     }
    34.     return i
    35. }
    36. function biCopy(n) {
    37.     var t = new BigInt(!0);
    38.     return t.digits = n.digits.slice(0),
    39.     t.isNeg = n.isNeg,
    40.     t
    41. }
    42. function biFromNumber(n) {
    43.     var t = new BigInt, i;
    44.     for (t.isNeg = n < 0,
    45.     n = Math.abs(n),
    46.     i = 0; n > 0; )
    47.         t.digits[i++] = n & maxDigitVal,
    48.         n = Math.floor(n / biRadix);
    49.     return t
    50. }
    51. function reverseStr(n) {
    52.     for (var i = "", t = n.length - 1; t > -1; --t)
    53.         i += n.charAt(t);
    54.     return i
    55. }
    56. function biToString(n, t) {
    57.     var r = new BigInt, i, u;
    58.     for (r.digits[0] = t,
    59.     i = biDivideModulo(n, r),
    60.     u = hexatrigesimalToChar[i[1].digits[0]]; biCompare(i[0], bigZero) == 1; )
    61.         i = biDivideModulo(i[0], r),
    62.         digit = i[1].digits[0],
    63.         u += hexatrigesimalToChar[i[1].digits[0]];
    64.     return (n.isNeg ? "-" : "") + reverseStr(u)
    65. }
    66. function biToDecimal(n) {
    67.     var i = new BigInt, t, r;
    68.     for (i.digits[0] = 10,
    69.     t = biDivideModulo(n, i),
    70.     r = String(t[1].digits[0]); biCompare(t[0], bigZero) == 1; )
    71.         t = biDivideModulo(t[0], i),
    72.         r += String(t[1].digits[0]);
    73.     return (n.isNeg ? "-" : "") + reverseStr(r)
    74. }
    75. function digitToHex(n) {
    76.     var t = "";
    77.     for (i = 0; i < 4; ++i)
    78.         t += hexToChar[n & 15],
    79.         n >>>= 4;
    80.     return reverseStr(t)
    81. }
    82. function biToHex(n) {
    83.     for (var i = "", r = biHighIndex(n), t = biHighIndex(n); t > -1; --t)
    84.         i += digitToHex(n.digits[t]);
    85.     return i
    86. }
    87. function charToHex(n) {
    88.     var t = 48
    89.       , u = t + 9
    90.       , i = 97
    91.       , f = i + 25
    92.       , r = 65;
    93.     return n >= t && n <= u ? n - t : n >= r && n <= 90 ? 10 + n - r : n >= i && n <= f ? 10 + n - i : 0
    94. }
    95. function hexToDigit(n) {
    96.     for (var t = 0, r = Math.min(n.length, 4), i = 0; i < r; ++i)
    97.         t <<= 4,
    98.         t |= charToHex(n.charCodeAt(i));
    99.     return t
    100. }
    101. function biFromHex(n) {
    102.     for (var i = new BigInt, u = n.length, t = u, r = 0; t > 0; t -= 4,
    103.     ++r)
    104.         i.digits[r] = hexToDigit(n.substr(Math.max(t - 4, 0), Math.min(t, 4)));
    105.     return i
    106. }
    107. function biFromString(n, t) {
    108.     var f = n.charAt(0) == "-", e = f ? 1 : 0, i = new BigInt, r = new BigInt, u;
    109.     for (r.digits[0] = 1,
    110.     u = n.length - 1; u >= e; u--) {
    111.         var o = n.charCodeAt(u)
    112.           , s = charToHex(o)
    113.           , h = biMultiplyDigit(r, s);
    114.         i = biAdd(i, h);
    115.         r = biMultiplyDigit(r, t)
    116.     }
    117.     return i.isNeg = f,
    118.     i
    119. }
    120. function biDump(n) {
    121.     return (n.isNeg ? "-" : "") + n.digits.join(" ")
    122. }
    123. function biAdd(n, t) {
    124.     var r, u, f, i;
    125.     if (n.isNeg != t.isNeg)
    126.         t.isNeg = !t.isNeg,
    127.         r = biSubtract(n, t),
    128.         t.isNeg = !t.isNeg;
    129.     else {
    130.         for (r = new BigInt,
    131.         u = 0,
    132.         i = 0; i < n.digits.length; ++i)
    133.             f = n.digits[i] + t.digits[i] + u,
    134.             r.digits[i] = f % biRadix,
    135.             u = Number(f >= biRadix);
    136.         r.isNeg = n.isNeg
    137.     }
    138.     return r
    139. }
    140. function biSubtract(n, t) {
    141.     var r, f, u, i;
    142.     if (n.isNeg != t.isNeg)
    143.         t.isNeg = !t.isNeg,
    144.         r = biAdd(n, t),
    145.         t.isNeg = !t.isNeg;
    146.     else {
    147.         for (r = new BigInt,
    148.         u = 0,
    149.         i = 0; i < n.digits.length; ++i)
    150.             f = n.digits[i] - t.digits[i] + u,
    151.             r.digits[i] = f % biRadix,
    152.             r.digits[i] < 0 && (r.digits[i] += biRadix),
    153.             u = 0 - Number(f < 0);
    154.         if (u == -1) {
    155.             for (u = 0,
    156.             i = 0; i < n.digits.length; ++i)
    157.                 f = 0 - r.digits[i] + u,
    158.                 r.digits[i] = f % biRadix,
    159.                 r.digits[i] < 0 && (r.digits[i] += biRadix),
    160.                 u = 0 - Number(f < 0);
    161.             r.isNeg = !n.isNeg
    162.         } else
    163.             r.isNeg = n.isNeg
    164.     }
    165.     return r
    166. }
    167. function biHighIndex(n) {
    168.     for (var t = n.digits.length - 1; t > 0 && n.digits[t] == 0; )
    169.         --t;
    170.     return t
    171. }
    172. function biNumBits(n) {
    173.     for (var i = biHighIndex(n), r = n.digits[i], u = (i + 1) * bitsPerDigit, t = u; t > u - bitsPerDigit; --t) {
    174.         if ((r & 32768) != 0)
    175.             break;
    176.         r <<= 1
    177.     }
    178.     return t
    179. }
    180. function biMultiply(n, t) {
    181.     for (var i = new BigInt, u, o = biHighIndex(n), s = biHighIndex(t), e, f, r = 0; r <= s; ++r) {
    182.         for (u = 0,
    183.         f = r,
    184.         j = 0; j <= o; ++j,
    185.         ++f)
    186.             e = i.digits[f] + n.digits[j] * t.digits[r] + u,
    187.             i.digits[f] = e & maxDigitVal,
    188.             u = e >>> biRadixBits;
    189.         i.digits[r + o + 1] = u
    190.     }
    191.     return i.isNeg = n.isNeg != t.isNeg,
    192.     i
    193. }
    194. function biMultiplyDigit(n, t) {
    195.     var u, r, f, i;
    196.     for (result = new BigInt,
    197.     u = biHighIndex(n),
    198.     r = 0,
    199.     i = 0; i <= u; ++i)
    200.         f = result.digits[i] + n.digits[i] * t + r,
    201.         result.digits[i] = f & maxDigitVal,
    202.         r = f >>> biRadixBits;
    203.     return result.digits[1 + u] = r,
    204.     result
    205. }
    206. function arrayCopy(n, t, i, r, u) {
    207.     for (var o = Math.min(t + u, n.length), f = t, e = r; f < o; ++f,
    208.     ++e)
    209.         i[e] = n[f]
    210. }
    211. function biShiftLeft(n, t) {
    212.     var e = Math.floor(t / bitsPerDigit), i = new BigInt, u, o, r, f;
    213.     for (arrayCopy(n.digits, 0, i.digits, e, i.digits.length - e),
    214.     u = t % bitsPerDigit,
    215.     o = bitsPerDigit - u,
    216.     r = i.digits.length - 1,
    217.     f = r - 1; r > 0; --r,
    218.     --f)
    219.         i.digits[r] = i.digits[r] << u & maxDigitVal | (i.digits[f] & highBitMasks[u]) >>> o;
    220.     return i.digits[0] = i.digits[r] << u & maxDigitVal,
    221.     i.isNeg = n.isNeg,
    222.     i
    223. }
    224. function biShiftRight(n, t) {
    225.     var e = Math.floor(t / bitsPerDigit), i = new BigInt, u, o, r, f;
    226.     for (arrayCopy(n.digits, e, i.digits, 0, n.digits.length - e),
    227.     u = t % bitsPerDigit,
    228.     o = bitsPerDigit - u,
    229.     r = 0,
    230.     f = r + 1; r < i.digits.length - 1; ++r,
    231.     ++f)
    232.         i.digits[r] = i.digits[r] >>> u | (i.digits[f] & lowBitMasks[u]) << o;
    233.     return i.digits[i.digits.length - 1] >>>= u,
    234.     i.isNeg = n.isNeg,
    235.     i
    236. }
    237. function biMultiplyByRadixPower(n, t) {
    238.     var i = new BigInt;
    239.     return arrayCopy(n.digits, 0, i.digits, t, i.digits.length - t),
    240.     i
    241. }
    242. function biDivideByRadixPower(n, t) {
    243.     var i = new BigInt;
    244.     return arrayCopy(n.digits, t, i.digits, 0, i.digits.length - t),
    245.     i
    246. }
    247. function biModuloByRadixPower(n, t) {
    248.     var i = new BigInt;
    249.     return arrayCopy(n.digits, 0, i.digits, 0, t),
    250.     i
    251. }
    252. function biCompare(n, t) {
    253.     if (n.isNeg != t.isNeg)
    254.         return 1 - 2 * Number(n.isNeg);
    255.     for (var i = n.digits.length - 1; i >= 0; --i)
    256.         if (n.digits[i] != t.digits[i])
    257.             return n.isNeg ? 1 - 2 * Number(n.digits[i] > t.digits[i]) : 1 - 2 * Number(n.digits[i] < t.digits[i]);
    258.     return 0
    259. }
    260. function biDivideModulo(n, t) {
    261.     var a = biNumBits(n), s = biNumBits(t), v = t.isNeg, r, i, u, e, h, o, f, y, p;
    262.     if (a < s)
    263.         return n.isNeg ? (r = biCopy(bigOne),
    264.         r.isNeg = !t.isNeg,
    265.         n.isNeg = !1,
    266.         t.isNeg = !1,
    267.         i = biSubtract(t, n),
    268.         n.isNeg = !0,
    269.         t.isNeg = v) : (r = new BigInt,
    270.         i = biCopy(n)),
    271.         [r, i];
    272.     for (r = new BigInt,
    273.     i = n,
    274.     u = Math.ceil(s / bitsPerDigit) - 1,
    275.     e = 0; t.digits[u] < biHalfRadix; )
    276.         t = biShiftLeft(t, 1),
    277.         ++e,
    278.         ++s,
    279.         u = Math.ceil(s / bitsPerDigit) - 1;
    280.     for (i = biShiftLeft(i, e),
    281.     a += e,
    282.     h = Math.ceil(a / bitsPerDigit) - 1,
    283.     o = biMultiplyByRadixPower(t, h - u); biCompare(i, o) != -1; )
    284.         ++r.digits[h - u],
    285.         i = biSubtract(i, o);
    286.     for (f = h; f > u; --f) {
    287.         var c = f >= i.digits.length ? 0 : i.digits[f]
    288.           , w = f - 1 >= i.digits.length ? 0 : i.digits[f - 1]
    289.           , b = f - 2 >= i.digits.length ? 0 : i.digits[f - 2]
    290.           , l = u >= t.digits.length ? 0 : t.digits[u]
    291.           , k = u - 1 >= t.digits.length ? 0 : t.digits[u - 1];
    292.         for (r.digits[f - u - 1] = c == l ? maxDigitVal : Math.floor((c * biRadix + w) / l),
    293.         y = r.digits[f - u - 1] * (l * biRadix + k),
    294.         p = c * biRadixSquared + (w * biRadix + b); y > p; )
    295.             --r.digits[f - u - 1],
    296.             y = r.digits[f - u - 1] * (l * biRadix | k),
    297.             p = c * biRadix * biRadix + (w * biRadix + b);
    298.         o = biMultiplyByRadixPower(t, f - u - 1);
    299.         i = biSubtract(i, biMultiplyDigit(o, r.digits[f - u - 1]));
    300.         i.isNeg && (i = biAdd(i, o),
    301.         --r.digits[f - u - 1])
    302.     }
    303.     return i = biShiftRight(i, e),
    304.     r.isNeg = n.isNeg != v,
    305.     n.isNeg && (r = v ? biAdd(r, bigOne) : biSubtract(r, bigOne),
    306.     t = biShiftRight(t, e),
    307.     i = biSubtract(t, i)),
    308.     i.digits[0] == 0 && biHighIndex(i) == 0 && (i.isNeg = !1),
    309.     [r, i]
    310. }
    311. function biDivide(n, t) {
    312.     return biDivideModulo(n, t)[0]
    313. }
    314. function biModulo(n, t) {
    315.     return biDivideModulo(n, t)[1]
    316. }
    317. function biMultiplyMod(n, t, i) {
    318.     return biModulo(biMultiply(n, t), i)
    319. }
    320. function biPow(n, t) {
    321.     for (var r = bigOne, i = n; ; ) {
    322.         if ((t & 1) != 0 && (r = biMultiply(r, i)),
    323.         t >>= 1,
    324.         t == 0)
    325.             break;
    326.         i = biMultiply(i, i)
    327.     }
    328.     return r
    329. }
    330. function biPowMod(n, t, i) {
    331.     for (var f = bigOne, u = n, r = t; ; ) {
    332.         if ((r.digits[0] & 1) != 0 && (f = biMultiplyMod(f, u, i)),
    333.         r = biShiftRight(r, 1),
    334.         r.digits[0] == 0 && biHighIndex(r) == 0)
    335.             break;
    336.         u = biMultiplyMod(u, u, i)
    337.     }
    338.     return f
    339. }
    340. function BarrettMu(n) {
    341.     this.modulus = biCopy(n);
    342.     this.k = biHighIndex(this.modulus) + 1;
    343.     var t = new BigInt;
    344.     t.digits[2 * this.k] = 1;
    345.     this.mu = biDivide(t, this.modulus);
    346.     this.bkplus1 = new BigInt;
    347.     this.bkplus1.digits[this.k + 1] = 1;
    348.     this.modulo = BarrettMu_modulo;
    349.     this.multiplyMod = BarrettMu_multiplyMod;
    350.     this.powMod = BarrettMu_powMod
    351. }
    352. function BarrettMu_modulo(n) {
    353.     var r = biDivideByRadixPower(n, this.k - 1), u = biMultiply(r, this.mu), f = biDivideByRadixPower(u, this.k + 1), e = biModuloByRadixPower(n, this.k + 1), o = biMultiply(f, this.modulus), s = biModuloByRadixPower(o, this.k + 1), t = biSubtract(e, s), i;
    354.     for (t.isNeg && (t = biAdd(t, this.bkplus1)),
    355.     i = biCompare(t, this.modulus) >= 0; i; )
    356.         t = biSubtract(t, this.modulus),
    357.         i = biCompare(t, this.modulus) >= 0;
    358.     return t
    359. }
    360. function BarrettMu_multiplyMod(n, t) {
    361.     var i = biMultiply(n, t);
    362.     return this.modulo(i)
    363. }
    364. function BarrettMu_powMod(n, t) {
    365.     var u = new BigInt, r, i;
    366.     for (u.digits[0] = 1,
    367.     r = n,
    368.     i = t; ; ) {
    369.         if ((i.digits[0] & 1) != 0 && (u = this.multiplyMod(u, r)),
    370.         i = biShiftRight(i, 1),
    371.         i.digits[0] == 0 && biHighIndex(i) == 0)
    372.             break;
    373.         r = this.multiplyMod(r, r)
    374.     }
    375.     return u
    376. }
    377. function RSAKeyPair(n, t, i) {
    378.     this.e = biFromHex(n);
    379.     this.d = biFromHex(t);
    380.     this.m = biFromHex(i);
    381.     this.digitSize = 2 * biHighIndex(this.m) + 2;
    382.     this.chunkSize = this.digitSize - 11;
    383.     this.radix = 16;
    384.     this.barrett = new BarrettMu(this.m)
    385. }
    386. function twoDigit(n) {
    387.     return (n < 10 ? "0" : "") + String(n)
    388. }
    389. function decryptedString(n, t) {
    390.     for (var e = t.split(" "), i = "", r, u, o, f = 0; f < e.length; ++f)
    391.         for (o = n.radix == 16 ? biFromHex(e[f]) : biFromString(e[f], n.radix),
    392.         u = n.barrett.powMod(o, n.d),
    393.         r = 0; r <= biHighIndex(u); ++r)
    394.             i += String.fromCharCode(u.digits[r] & 255, u.digits[r] >> 8);
    395.     return i.charCodeAt(i.length - 1) == 0 && (i = i.substring(0, i.length - 1)),
    396.     i
    397. }
    399. 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, dpl10, lr10, hexatrigesimalToChar, hexToChar, highBitMasks, lowBitMasks;
    400. setMaxDigits(20);
    401. dpl10 = 15;
    402. lr10 = biFromNumber(1e15);
    403. hexatrigesimalToChar = ["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"];
    404. hexToChar = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"];
    405. highBitMasks = [0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535];
    406. lowBitMasks = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535];
    407. setMaxDigits(129);
    411. function encryptedString(t) {
    412.     var n = new RSAKeyPair("010001", "", "978C0A92D2173439707498F0944AA476B1B62595877DD6FA87F6E2AC6DCB3D0BF0B82857439C99B5091192BC134889DFF60C562EC54EFBA4FF2F9D55ADBCCEA4A2FBA80CB398ED501280A007C83AF30C3D1A142D6133C63012B90AB26AC60C898FB66EDC3192C3EC4FF66925A64003B72496099F4F09A9FB72A2CF9E4D770C41");
    413.     var e, o, s, h, c, i, f, u, v, l, y;
    414.     if (n.chunkSize > n.digitSize - 11)
    415.         return "Error";
    416.     for (var a = [], p = t.length, r = 0; r < p; )
    417.         a[r] = t.charCodeAt(r),
    418.         r++;
    419.     for (e = a.length,
    420.     o = "",
    421.     r = 0; r < e; r += n.chunkSize) {
    422.         for (c = new BigInt,
    423.         s = 0,
    424.         f = r + n.chunkSize > e ? e % n.chunkSize : n.chunkSize,
    425.         u = [],
    426.         i = 0; i < f; i++)
    427.             u[i] = a[r + f - 1 - i];
    428.         for (u[f] = 0,
    429.         v = Math.max(8, n.digitSize - 3 - f),
    430.         i = 0; i < v; i++)
    431.             u[f + 1 + i] = Math.floor(Math.random() * 254) + 1;
    432.         for (u[n.digitSize - 2] = 2,
    433.         u[n.digitSize - 1] = 0,
    434.         h = 0; h < n.digitSize; ++s)
    435.             c.digits[s] = u[h++],
    436.             c.digits[s] += u[h++] << 8;
    437.         l = n.barrett.powMod(c, n.e);
    438.         y = n.radix == 16 ? biToHex(l) : biToString(l, n.radix);
    439.         o += y + " "
    440.     }
    441.     return o.substring(0, o.length - 1)
    442. }
    443. //console.log(encryptedString(key_to_encode,'123456'))
    1. import requests
    2. import execjs
    4. def get_js(file_name,fun_name,fun_args=None):
    5.     # 1、读取js文件
    6.     with open(file_name,'r',encoding='utf-8') as file_obj:
    7.         js_code = file_obj.read()
    8.     # 2、编译js文件
    9.     cjs = execjs.compile(js_code)
    10.     # 3、 执行js代码
    11.     return cjs.call(fun_name,fun_args)
    13. if __name__ == '__main__':
    14.     password = 'aimama412304'
    15.     pwd = get_js('./fang.js','encryptedString',password)
    16.     dict = {}
    17.     dict['uid'] = '马智强'
    18.     dict['pwd'] = pwd
    19.     dict['Service'] = 'soufun-passport-web'
    20.     dict['AutoLogin'] = 1
    21.     headers = {
    22.         'User-Agent':'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/99.0.4844.74 Safari/537.36',
    23.         'Referer':'https://passport.fang.com/'
    24.     }
    25.     res = requests.post(url='https://passport.fang.com/login.api',data=dict,headers = headers)
    26.     print(res.json())