摘要：
chall.py #Subset Sum Problem #https://imgs.xkcd.com/comics/np_complete.png import random choices = list(set([random.randint(100000,1000000000) for _ i 阅读全文
posted @ 2023-11-10 16:00
N0zoM1z0
阅读(36)
评论(0)
推荐(0)
摘要：
目录XOReasymath撤退3!!!easyrsa XOR n = 2081029853064313977972537933555768796028190509610710141158522091867265332387523434454034280165112366755381286645879 阅读全文
posted @ 2023-11-10 15:05
N0zoM1z0
阅读(151)
评论(0)
推荐(0)
摘要：
1. chall.py from Crypto.Util.number import * from flag import flag import gmpy2 assert(len(flag)==38) flag = bytes_to_long(flag) p = getPrime(512) q = 阅读全文
posted @ 2023-11-10 08:34
N0zoM1z0
阅读(47)
评论(0)
推荐(0)
浙公网安备 33010602011771号