[b01lers2020]Welcome to Earth

最新推荐文章于 2024-09-19 17:56:32 发布

双层小牛堡

最新推荐文章于 2024-09-19 17:56:32 发布

阅读量170

点赞数

分类专栏： BUUctf 文章标签： javascript

本文链接：https://blog.csdn.net/m0_64180167/article/details/133529382

版权

BUUctf 专栏收录该内容

58 篇文章 1 订阅

订阅专栏

类似签到题了

一直看js就可以获得最后的混淆

// Run to scramble original flag
//console.log(scramble(flag, action));
function scramble(flag, key) {
  for (var i = 0; i < key.length; i++) {
    let n = key.charCodeAt(i) % flag.length;
    let temp = flag[i];
    flag[i] = flag[n];
    flag[n] = temp;
  }
  return flag;
}

function check_action() {
  var action = document.getElementById("action").value;
  var flag = ["{hey", "_boy", "aaaa", "s_im", "ck!}", "_baa", "aaaa", "pctf"];

  // TODO: unscramble function
}

其实猜一下也可以

或者可以利用排列组合的排列来搞

直接利用py代码

itertools

from itertools import permutations

flag = ["{hey", "_boy", "aaaa", "s_im", "ck!}", "_baa", "aaaa", "pctf"]

item = permutations(flag)

for i in item:
    k=''.join(list(i))
    if k.startswith('pctf{')    and k[-1]=='}':
        print(k)