分类 JS逆向下的文章 - Lan小站-嗯，不错！

2022-03-14

利用js去除无限debugger csdn看见的，还别说，挺好用//去除无限debugger Function.prototype.__constructor_back = Function.prototype.constructor ; Function.prototype.constructor = function() { if(arguments && typeof arguments[0]==='string'){ //alert("new function: "+ arguments[0]); if( "debugger" === arguments[0]){ //arguments[0]="consoLe.Log(\"anti debugger\");"; //arguments[0]=";"; return } } return Function.prototype.__constructor_back.apply(this,arguments); }原文链接：https://blog.csdn.net/qq_39799322/article/details/119275806

2022年03月14日
803 阅读
1 评论
0 点赞

2021-12-19

校友邦请求参数加密 function a(e, n) { var c = (65535 & e) + (65535 & n); return (e >> 16) + (n >> 16) + (c >> 16) << 16 | 65535 & c } function t(e, n, c, t, i, o) { return a((u = a(a(n, e), a(t, o))) << (r = i) | u >>> 32 - r, c); var u, r } function i(e, n, c, a, i, o, u) { return t(n & c | ~n & a, e, n, i, o, u) } function o(e, n, c, a, i, o, u) { return t(n & a | c & ~a, e, n, i, o, u) } function u(e, n, c, a, i, o, u) { return t(n ^ c ^ a, e, n, i, o, u) } function r(e, n, c, a, i, o, u) { return t(c ^ (n | ~a), e, n, i, o, u) } function d(e) { for (var n = 1732584193, c = -271733879, t = -1732584194, d = 271733878, h = 0; h < e.length; h += 16) { var s = n, l = c, b = t, k = d; c = r(c = r(c = r(c = r(c = u(c = u(c = u(c = u(c = o(c = o(c = o(c = o(c = i(c = i(c = i(c = i(c, t = i(t, d = i(d, n = i(n, c, t, d, e[h + 0], 7, -680876936), c, t, e[h + 1], 12, -389564586), n, c, e[h + 2], 17, 606105819), d, n, e[h + 3], 22, -1044525330), t = i(t, d = i(d, n = i(n, c, t, d, e[h + 4], 7, -176418897), c, t, e[h + 5], 12, 1200080426), n, c, e[h + 6], 17, -1473231341), d, n, e[h + 7], 22, -45705983), t = i(t, d = i(d, n = i(n, c, t, d, e[h + 8], 7, 1770035416), c, t, e[h + 9], 12, -1958414417), n, c, e[h + 10], 17, -42063), d, n, e[h + 11], 22, -1990404162), t = i(t, d = i(d, n = i(n, c, t, d, e[h + 12], 7, 1804603682), c, t, e[h + 13], 12, -40341101), n, c, e[h + 14], 17, -1502002290), d, n, e[h + 15], 22, 1236535329), t = o(t, d = o(d, n = o(n, c, t, d, e[h + 1], 5, -165796510), c, t, e[h + 6], 9, -1069501632), n, c, e[h + 11], 14, 643717713), d, n, e[h + 0], 20, -373897302), t = o(t, d = o(d, n = o(n, c, t, d, e[h + 5], 5, -701558691), c, t, e[h + 10], 9, 38016083), n, c, e[h + 15], 14, -660478335), d, n, e[h + 4], 20, -405537848), t = o(t, d = o(d, n = o(n, c, t, d, e[h + 9], 5, 568446438), c, t, e[h + 14], 9, -1019803690), n, c, e[h + 3], 14, -187363961), d, n, e[h + 8], 20, 1163531501), t = o(t, d = o(d, n = o(n, c, t, d, e[h + 13], 5, -1444681467), c, t, e[h + 2], 9, -51403784), n, c, e[h + 7], 14, 1735328473), d, n, e[h + 12], 20, -1926607734), t = u(t, d = u(d, n = u(n, c, t, d, e[h + 5], 4, -378558), c, t, e[h + 8], 11, -2022574463), n, c, e[h + 11], 16, 1839030562), d, n, e[h + 14], 23, -35309556), t = u(t, d = u(d, n = u(n, c, t, d, e[h + 1], 4, -1530992060), c, t, e[h + 4], 11, 1272893353), n, c, e[h + 7], 16, -155497632), d, n, e[h + 10], 23, -1094730640), t = u(t, d = u(d, n = u(n, c, t, d, e[h + 13], 4, 681279174), c, t, e[h + 0], 11, -358537222), n, c, e[h + 3], 16, -722521979), d, n, e[h + 6], 23, 76029189), t = u(t, d = u(d, n = u(n, c, t, d, e[h + 9], 4, -640364487), c, t, e[h + 12], 11, -421815835), n, c, e[h + 15], 16, 530742520), d, n, e[h + 2], 23, -995338651), t = r(t, d = r(d, n = r(n, c, t, d, e[h + 0], 6, -198630844), c, t, e[h + 7], 10, 1126891415), n, c, e[h + 14], 15, -1416354905), d, n, e[h + 5], 21, -57434055), t = r(t, d = r(d, n = r(n, c, t, d, e[h + 12], 6, 1700485571), c, t, e[h + 3], 10, -1894986606), n, c, e[h + 10], 15, -1051523), d, n, e[h + 1], 21, -2054922799), t = r(t, d = r(d, n = r(n, c, t, d, e[h + 8], 6, 1873313359), c, t, e[h + 15], 10, -30611744), n, c, e[h + 6], 15, -1560198380), d, n, e[h + 13], 21, 1309151649), t = r(t, d = r(d, n = r(n, c, t, d, e[h + 4], 6, -145523070), c, t, e[h + 11], 10, -1120210379), n, c, e[h + 2], 15, 718787259), d, n, e[h + 9], 21, -343485551), n = a(n, s), c = a(c, l), t = a(t, b), d = a(d, k) } return [n, c, t, d] } function h(e) { for (var n = "0123456789abcdef", c = "", a = 0; a < 4 * e.length; a++) c += n.charAt(e[a >> 2] >> a % 4 * 8 + 4 & 15) + n.charAt(e[a >> 2] >> a % 4 * 8 & 15); return c }  function s(e) { for (var n = 1 + (e.length + 8 >> 6), c = new Array(16 * n), a = 0; a < 16 * n; a++) c[a] = 0; for (a = 0; a < e.length; a++) c[a >> 2] |= (255 & e.charCodeAt(a)) << a % 4 * 8; return c[a >> 2] |= 128 << a % 4 * 8, c[16 * n - 2] = 8 * e.length, c } var l = { hexMD5: function(e) { return h(d(s(e))) } }, b = new RegExp("[`~!@#$%^&*()+=|{}':;',\\[\\].<>/?~！@#￥%……&*（）——+|{}【】‘；：”“’。，、？]"), k = (new RegExp("[\\u4E00-\\u9FFF]+"), function(e) { var n = ["`", "~", "!", "@", "#", "$", "%", "^", "&", "*", "(", ")", "+", "=", "|", "{", "}", "'", ":", ";", "'", ",", "[", "]", ".", "<", ">", "/", "?", "~", "！", "@", "#", "￥", "%", "…", "…", "&", "*", "（", "）", "—", "—", "+", "|", "{", "}", "【", "】", "‘", "；", "：", "”", "“", "’", "。", "，", "、", "？", '"'], c = ["content", "practicePurpose", "practiceContent", "practiceRequirement", "otherRequirement", "practiceDescript", "securityBook", "file", "uploadJson"]; for (var a in e) { var t = e[a] + ""; t && t.split("").some(function(e, t) { if (-1 < n.indexOf(e)) return -1 == c.indexOf(a) && c.push(a), !0 }) } return c })  function LanEncode(e, n) { for (var c = ["5", "b", "f", "A", "J", "Q", "g", "a", "l", "p", "s", "q", "H", "4", "L", "Q", "g", "1", "6", "Q", "Z", "v", "w", "b", "c", "e", "2", "2", "m", "l", "E", "g", "G", "H", "I", "r", "o", "s", "d", "5", "7", "x", "t", "J", "S", "T", "F", "v", "w", "4", "8", "9", "0", "K", "E", "3", "4", "0", "m", "r", "i", "n"], a = [], t = 0; t < 62; t++) a.push(t + ""); var i = Math.round((new Date).getTime() / 1e3), o = function(e, n) { for (var c, a, t = e.slice(0), i = e.length, o = i - n; i-- > o;) c = t[a = Math.floor((i + 1) * Math.random())], t[a] = t[i], t[i] = c; return t.slice(o) }(a, 20), u = ""; o.forEach(function(e, n) { u += c[e] }); var r = function(e) { if (null == e) return {}; for (var n = Object.keys(e).sort(), c = {}, a = 0; a < n.length; a++) c[n[a]] = e[n[a]]; return c }(e), d = ""; for (var h in r) - 1 != k().indexOf(h) || b.test(r[h]) || null != r[h] && "" !== r[h] && '""' !== r[h] && (d += r[h]); return d += i, d = (d = (d = (d = (d = (d = (d = (d = (d += u).replace(/\s+/g, "")).replace(/\n+/g, "")).replace(/\r+/g, "")).replace(/</g, "")).replace(/>/g, "")).replace(/&/g, "")).replace(/-/g, "")).replace(/\uD83C[\uDF00-\uDFFF]|\uD83D[\uDC00-\uDE4F]/g, ""), d = encodeURIComponent(d), { md5: d = l.hexMD5(d), tstr: i, iArrStr: o && 0 < o.length ? o.join("_") : "" } }

2021年12月19日
495 阅读
0 评论
2 点赞

2021-09-10

2021年09月10日
807 阅读
0 评论
2 点赞

2021-09-04

2021年09月04日
539 阅读
0 评论
0 点赞

2021-09-03

JS逆向之跳过无限Debugger，搞定反调试之无限debugger 咳咳，今天上班的时候，有位大佬在钉钉群里发了一个链接，随后就撤回了，但还是被我看见了，便点进去看了一下然后回到首页，一看。哦吼，这不就激起我的好奇心了嘛。然后点进第一题。。。就开始了我的摸鱼之旅，搞了一上午总算把第一题弄出来了，只能说我还是太菜了。然后其中有一个无限Debugger，我最一开始是关掉了调试。然后找到了接口，看了一个参数m，不调试不行呀，然后我想到用Burpsuite在页面加载之前就把这两行引用代码干掉。发现不太行，页面一刷新他就又回来了，然后我想到反正只要不加载就行了，好像浏览器里面自带一个block request url右键这个js请求，然后block request url就可以了。搞定，但是好像此方法仅限于js中没有重要代码的。

2021年09月03日
534 阅读
0 评论
0 点赞

2021-07-22

解密软协活动，红包口令在这里昨天发布了一个活动，软协有奖挑战：红包口令在哪里然后直到结束也没有人解出来，其实我提示过图片不一定是图片。然后解密过程如下：首先看到这张照片，可能有些人直接就只在图片上面找东西，其实不然。我们把这张图片保存到本地。然后将后缀名改为zip，你以为是张图片，其实他是个压缩包。里面有一张二维码，扫码之后，进入到一个网址：https://sing.lanol.cn/challenge然后查看该网页源代码。可以看到一串隐藏的md5加密字符串：1BC9A57281DB4721E24D2901E9FE2D98拿去解密可以得到一个日期，这个为软件技术协会创立日期。这个时候，把这个数字发送到上面那个网页中的公众号里面即可得到红包口令。

2021年07月22日
358 阅读
0 评论
0 点赞

2021-04-24

强智教务系统登陆JS逆向去年这个时候，好像就研究过我们学校的教务系统登陆，当初不知道啥原因弄了一下就放弃了今天又试了一下，发现挺容易的，然后用Python实现了一下。登陆成功后，获取课表

2021年04月24日
832 阅读
0 评论
0 点赞