devbox
凡人多烦事01
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

11、利得金融网页Post登陆RSA算法加密分析【Post/Js逆向笔记】_rsa post

作者：凡人多烦事01 | 2024-05-30 13:34:10

赞

踩

rsa post

发布文章内容，只为自己自学逆向分析做一个记录，方便以后加以巩固学习逆向分析。
本人为逆向学习小白，所以发布的内容都是简单的逆向分析。大佬请高抬贵手！

 1、分析的登陆网站地址

http://www.leadbank.com.cn/login/

2、使用工具

  1. chrome浏览器
  2.  
  3. 鬼鬼调试工具

3、Post抓包登陆分析

  1. 测试账号 Steven2020  测试密码 a123456
  2.  
  3. post提交 返回数据 
  4.  
  5. data: d59b937110d12446c0f10347b66e03c5014fb8bc462eb7544ca52656dbd6860007e283fc5f7e323c2fd2645924fe7c6151feb342cbfc545ff53da3c929db2d950d9e762d9d550f44272a0d26397f44262733cd31ec76c6ea5c11102363235a121523c43e6cb7c2aa7d5155c038e38f706c094bf6b0ddf4a2dfcae2f13ca8a7d936d4189f2b5303c74ffa82112ee9744a72f02d04da67cee53d4e29a50c5bf9beec12738aacc9506e432de1a16b041ba317893a51b863893d7c6d9e557d09f36f8679acee25c726107b3c0ddf4b67b509c7c573d6a7e43f1626ab23e78276ee17f94654ae252e0ee459f4ecf438888a61c421c637da9bb3928f766031bc3545e5
  6.  
  7.  
  8.  
  9. 仅仅只有一个data 参数，说明 是多个参数拼接后进行的加密

4、data解密

首先通过"data=" 这个关键词去全局搜索 哪个 JS文件 定义过这个参数。

加上 =   是为了可以更佳精准的搜索到

最终找到一个 字符串拼接的js,点击进入后，下断点调试

 

下断点后，可以发现，这个 变量 e  是  

"{"terminal":"WEB","reqTime":"Sun, 31 Jan 2021 13:56:08 GMT","accessTerminal":"WEB","clientVersion":"4.1.0","version":"1.0","channelCode":"LD","appId":1002,"custMobile":"13888888888","custLoginPsw":"a123456","verifyCode":"36796"}"

 

包含了上面红框中的信息，除了一个 reqTime 是 取基于世界协调通用时间(UTC)，另外的都是固定的值。加上"custMobile":"13888888888","custLoginPsw":"a123456","verifyCode":"36796"，用户名 密码 和 验证码。然后进行 Object(f.a)() 方法进行加密；

 

进入 Object(f.a)(e) 的这个方法，发现存在公钥，那么就是一个RSA算法了。

 

现在的话，就是把这个加密算法的代码进行扣下来，首先把这个 function J() 函数 扣下来；

  1.         function J(t) {
  2.             var data = t.split("").reverse().join("");
  3.             !function(t) {
  4.                 o = new Array(t);
  5.                 for (var e = 0; e < o.length; e++)
  6.                     o[e] = 0;
  7.                 d = new h,
  8.                 (n = new h).digits[0] = 1
  9.             }(130);
  10.             for (var e = new x("10001","","d741760e63aab01eecf8f2237468da2c9a1f3dfb7de74d8bed23de8eb734b0771aa88ab3acfe3d223f24c057a37f8976cd592a5061fba10cfa212ac7448ef4ce9710a3c5ecb176ed10f55612de976edda1a000faf74923efa80645d0654588c1bc314a28879aeda2ed08b0b83c3582ef3de1fe9125aa67130cdfcd3128732461"), r = data.length, l = "", c = 0, i = 0; r - c > 0; )
  11.                 l = L(e, r - c > 128 ? data.substr(c, 128) : data.substr(c, r - c)) + l,
  12.                 c = 128 * ++i;
  13.             return l
  14.         }

然后开始缺少啥对象，或者是参数，就在扣相应的函数；

最终扣完了所有登陆的加密的代码

  1.         var o, n, d, l = [0, 32768, 49152, 57344, 61440, 63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535], c = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535], f = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"];
  2.  
  3.  function h(t) {
  4.             this.digits = "boolean" == typeof t && 1 == t ? null : o.slice(0),
  5.             this.isNeg = !1
  6.         }
  7.         function v(s) {
  8.             for (var t = new h, i = s.length, e = 0; i > 0; i -= 4,
  9.             ++e)
  10.                 t.digits[e] = m(s.substr(Math.max(i - 4, 0), Math.min(i, 4)));
  11.             return t
  12.         }
  13.         function m(s) {
  14.             for (var t, e = 0, r = Math.min(s.length, 4), i = 0; i < r; ++i)
  15.                 e <<= 4,
  16.                 e |= (t = s.charCodeAt(i)) >= 48 && t <= 57 ? t - 48 : t >= 65 && t <= 90 ? 10 + t - 65 : t >= 97 && t <= 122 ? 10 + t - 97 : 0;
  17.             return e
  18.         }
  19.         function x(t, e, r) {
  20.             this.e = v(t),
  21.             this.d = v(e),
  22.             this.m = v(r),
  23.             this.chunkSize = 128,
  24.             this.radix = 16,
  25.             this.barrett = new w(this.m)
  26.         }
  27.         function k(t) {
  28.             var e = new h(!0);
  29.             return e.digits = t.digits.slice(0),
  30.             e.isNeg = t.isNeg,
  31.             e
  32.         }
  33.         function w(t) {
  34.             this.modulus = k(t),
  35.             this.k = A(this.modulus) + 1;
  36.             var e, r, o = new h;
  37.             o.digits[2 * this.k] = 1,
  38.             this.mu = (e = o,
  39.             r = this.modulus,
  40.             y(e, r)[0]),
  41.             this.bkplus1 = new h,
  42.             this.bkplus1.digits[this.k + 1] = 1,
  43.             this.modulo = T,
  44.             this.multiplyMod = U,
  45.             this.powMod = I
  46.         }
  47.         function A(t) {
  48.             for (var e = t.digits.length - 1; e > 0 && 0 == t.digits[e]; )
  49.                 --e;
  50.             return e
  51.         }
  52.         function y(t, e) {
  53.             var q, r, o = j(t), d = j(e), l = e.isNeg;
  54.             if (o < d)
  55.                 return t.isNeg ? ((q = k(n)).isNeg = !e.isNeg,
  56.                 t.isNeg = !1,
  57.                 e.isNeg = !1,
  58.                 r = O(e, t),
  59.                 t.isNeg = !0,
  60.                 e.isNeg = l) : (q = new h,
  61.                 r = k(t)),
  62.                 [q, r];
  63.             q = new h,
  64.             r = t;
  65.             for (var c = Math.ceil(d / 16) - 1, f = 0; e.digits[c] < 32768; )
  66.                 e = _(e, 1),
  67.                 ++f,
  68.                 ++d,
  69.                 c = Math.ceil(d / 16) - 1;
  70.             r = _(r, f),
  71.             o += f;
  72.             for (var m = Math.ceil(o / 16) - 1, b = z(e, m - c); -1 != N(r, b); )
  73.                 ++q.digits[m - c],
  74.                 r = O(r, b);
  75.             for (var i = m; i > c; --i) {
  76.                 var v = i >= r.digits.length ? 0 : r.digits[i]
  77.                   , x = i - 1 >= r.digits.length ? 0 : r.digits[i - 1]
  78.                   , w = i - 2 >= r.digits.length ? 0 : r.digits[i - 2]
  79.                   , y = c >= e.digits.length ? 0 : e.digits[c]
  80.                   , C = c - 1 >= e.digits.length ? 0 : e.digits[c - 1];
  81.                 q.digits[i - c - 1] = v == y ? 65535 : Math.floor((65536 * v + x) / y);
  82.                 for (var T = q.digits[i - c - 1] * (65536 * y + C), U = 4294967296 * v + (65536 * x + w); T > U; )
  83.                     --q.digits[i - c - 1],
  84.                     T = q.digits[i - c - 1] * (65536 * y | C),
  85.                     U = 65536 * v * 65536 + (65536 * x + w);
  86.                 (r = O(r, E(b = z(e, i - c - 1), q.digits[i - c - 1]))).isNeg && (r = Q(r, b),
  87.                 --q.digits[i - c - 1])
  88.             }
  89.             return r = S(r, f),
  90.             q.isNeg = t.isNeg != l,
  91.             t.isNeg && (q = l ? Q(q, n) : O(q, n),
  92.             r = O(e = S(e, f), r)),
  93.             0 == r.digits[0] && 0 == A(r) && (r.isNeg = !1),
  94.             [q, r]
  95.         }
  96.         function j(t) {
  97.             var e, r = A(t), o = t.digits[r], n = 16 * (r + 1);
  98.             for (e = n; e > n - 16 && 0 == (32768 & o); --e)
  99.                 o <<= 1;
  100.             return e
  101.         }
  102.         function _(t, e) {
  103.             var r = Math.floor(e / 16)
  104.               , o = new h;
  105.             C(t.digits, 0, o.digits, r, o.digits.length - r);
  106.             for (var n = e % 16, d = 16 - n, i = o.digits.length - 1, c = i - 1; i > 0; --i,
  107.             --c)
  108.                 o.digits[i] = o.digits[i] << n & 65535 | (o.digits[c] & l[n]) >>> d;
  109.             return o.digits[0] = o.digits[i] << n & 65535,
  110.             o.isNeg = t.isNeg,
  111.             o
  112.         }
  113.         function C(t, e, r, o, n) {
  114.             for (var d = Math.min(e + n, t.length), i = e, l = o; i < d; ++i,
  115.             ++l)
  116.                 r[l] = t[i]
  117.         }
  118.         function z(t, e) {
  119.             var r = new h;
  120.             return C(t.digits, 0, r.digits, e, r.digits.length - e),
  121.             r
  122.         }
  123.         function N(t, e) {
  124.             if (t.isNeg != e.isNeg)
  125.                 return 1 - 2 * Number(t.isNeg);
  126.             for (var i = t.digits.length - 1; i >= 0; --i)
  127.                 if (t.digits[i] != e.digits[i])
  128.                     return t.isNeg ? 1 - 2 * Number(t.digits[i] > e.digits[i]) : 1 - 2 * Number(t.digits[i] < e.digits[i]);
  129.             return 0
  130.         }
  131.         function O(t, e) {
  132.             var r;
  133.             if (t.isNeg != e.isNeg)
  134.                 e.isNeg = !e.isNeg,
  135.                 r = Q(t, e),
  136.                 e.isNeg = !e.isNeg;
  137.             else {
  138.                 var o, n;
  139.                 r = new h,
  140.                 n = 0;
  141.                 for (var i = 0; i < t.digits.length; ++i)
  142.                     o = t.digits[i] - e.digits[i] + n,
  143.                     r.digits[i] = o % 65536,
  144.                     r.digits[i] < 0 && (r.digits[i] += 65536),
  145.                     n = 0 - Number(o < 0);
  146.                 if (-1 == n) {
  147.                     n = 0;
  148.                     for (var d = 0; d < t.digits.length; ++d)
  149.                         o = 0 - r.digits[d] + n,
  150.                         r.digits[d] = o % 65536,
  151.                         r.digits[d] < 0 && (r.digits[d] += 65536),
  152.                         n = 0 - Number(o < 0);
  153.                     r.isNeg = !t.isNeg
  154.                 } else
  155.                     r.isNeg = t.isNeg
  156.             }
  157.             return r
  158.         }
  159.         function E(t, e) {
  160.             var r, o, n, d = new h;
  161.             r = A(t),
  162.             o = 0;
  163.             for (var l = 0; l <= r; ++l)
  164.                 n = d.digits[l] + t.digits[l] * e + o,
  165.                 d.digits[l] = 65535 & n,
  166.                 o = n >>> 16;
  167.             return d.digits[1 + r] = o,
  168.             d
  169.         }
  170.         function S(t, e) {
  171.             var r = Math.floor(e / 16)
  172.               , o = new h;
  173.             C(t.digits, r, o.digits, 0, t.digits.length - r);
  174.             for (var n = e % 16, d = 16 - n, i = 0, l = i + 1; i < o.digits.length - 1; ++i,
  175.             ++l)
  176.                 o.digits[i] = o.digits[i] >>> n | (o.digits[l] & c[n]) << d;
  177.             return o.digits[o.digits.length - 1] >>>= n,
  178.             o.isNeg = t.isNeg,
  179.             o
  180.         }
  181.         function T(t) {
  182.             var e = R(t, this.k - 1)
  183.               , r = R(B(e, this.mu), this.k + 1)
  184.               , o = O(F(t, this.k + 1), F(B(r, this.modulus), this.k + 1));
  185.             o.isNeg && (o = Q(o, this.bkplus1));
  186.             for (var n = N(o, this.modulus) >= 0; n; )
  187.                 n = N(o = O(o, this.modulus), this.modulus) >= 0;
  188.             return o
  189.         }
  190.         function U(t, e) {
  191.             var r = B(t, e);
  192.             return this.modulo(r)
  193.         }
  194.         function I(t, e) {
  195.             var r = new h;
  196.             r.digits[0] = 1;
  197.             for (var a = t, o = e; 0 != (1 & o.digits[0]) && (r = this.multiplyMod(r, a)),
  198.             0 != (o = S(o, 1)).digits[0] || 0 != A(o); )
  199.                 a = this.multiplyMod(a, a);
  200.             return r
  201.         }
  202.         function L(t, s) {
  203.             for (var a = [], e = s.length, i = 0; i < e; )
  204.                 a[i] = s.charCodeAt(i),
  205.                 i++;
  206.             for (; a.length % t.chunkSize != 0; )
  207.                 a[i++] = 0;
  208.             var r, o, n, d = a.length, l = "";
  209.             for (i = 0; i < d; i += t.chunkSize) {
  210.                 for (n = new h,
  211.                 r = 0,
  212.                 o = i; o < i + t.chunkSize; ++r)
  213.                     n.digits[r] = a[o++],
  214.                     n.digits[r] += a[o++] << 8;
  215.                 var c = t.barrett.powMod(n, t.e);
  216.                 l += (16 == t.radix ? D(c) : H(c, t.radix)) + " "
  217.             }
  218.             return l.substring(0, l.length - 1)
  219.         }
  220.         function B(t, e) {
  221.             for (var r, o, n, d = new h, l = A(t), c = A(e), i = 0; i <= c; ++i) {
  222.                 r = 0,
  223.                 n = i;
  224.                 for (var f = 0; f <= l; ++f,
  225.                 ++n)
  226.                     o = d.digits[n] + t.digits[f] * e.digits[i] + r,
  227.                     d.digits[n] = 65535 & o,
  228.                     r = o >>> 16;
  229.                 d.digits[i + l + 1] = r
  230.             }
  231.             return d.isNeg = t.isNeg != e.isNeg,
  232.             d
  233.         }
  234.         function R(t, e) {
  235.             var r = new h;
  236.             return C(t.digits, e, r.digits, 0, r.digits.length - e),
  237.             r
  238.         }
  239.         function F(t, e) {
  240.             var r = new h;
  241.             return C(t.digits, 0, r.digits, 0, e),
  242.             r
  243.         }
  244.         function D(t) {
  245.             for (var e = "", i = A(t); i > -1; --i)
  246.                 e += P(t.digits[i]);
  247.             return e
  248.         }
  249.         function P(t) {
  250.             for (var e = "", i = 0; i < 4; ++i)
  251.                 e += f[15 & t],
  252.                 t >>>= 4;
  253.             return M(e)
  254.         }
  255.         function M(s) {
  256.             for (var t = "", i = s.length - 1; i > -1; --i)
  257.                 t += s.charAt(i);
  258.             return t
  259.         }
  260.         function Q(t, e) {
  261.             var r;
  262.             if (t.isNeg != e.isNeg)
  263.                 e.isNeg = !e.isNeg,
  264.                 r = O(t, e),
  265.                 e.isNeg = !e.isNeg;
  266.             else {
  267.                 r = new h;
  268.                 for (var o, n = 0, i = 0; i < t.digits.length; ++i)
  269.                     o = t.digits[i] + e.digits[i] + n,
  270.                     r.digits[i] = o % 65536,
  271.                     n = Number(o >= 65536);
  272.                 r.isNeg = t.isNeg
  273.             }
  274.             return r
  275.         }
  276.         var V = ["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"];
  277.         function H(t, e) {
  278.             var b = new h;
  279.             b.digits[0] = e;
  280.             for (var r = y(t, b), o = V[r[1].digits[0]]; 1 == N(r[0], d); )
  281.                 r = y(r[0], b),
  282.                 o += V[r[1].digits[0]];
  283.             return (t.isNeg ? "-" : "") + M(o)
  284.         }
  285.         function J(t) {
  286.             var data = t.split("").reverse().join("");
  287.             !function(t) {
  288.                 o = new Array(t);
  289.                 for (var e = 0; e < o.length; e++)
  290.                     o[e] = 0;
  291.                 d = new h,
  292.                 (n = new h).digits[0] = 1
  293.             }(130);
  294.             for (var e = new x("10001","","d741760e63aab01eecf8f2237468da2c9a1f3dfb7de74d8bed23de8eb734b0771aa88ab3acfe3d223f24c057a37f8976cd592a5061fba10cfa212ac7448ef4ce9710a3c5ecb176ed10f55612de976edda1a000faf74923efa80645d0654588c1bc314a28879aeda2ed08b0b83c3582ef3de1fe9125aa67130cdfcd3128732461"), r = data.length, l = "", c = 0, i = 0; r - c > 0; )
  295.                 l = L(e, r - c > 128 ? data.substr(c, 128) : data.substr(c, r - c)) + l,
  296.                 c = 128 * ++i;
  297.             return l
  298.         }

 放入鬼鬼调试工具中，进行测试

  测试出来的加密结果 和  网页中获取到的一模一样，那么至此这个登陆的RSA算法就破解了！

 

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/凡人多烦事01/article/detail/647182
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号