ByteCTF之密码题lrlr

最新推荐文章于 2024-01-25 22:08:11 发布

RayLee23333

最新推荐文章于 2024-01-25 22:08:11 发布

阅读量2.6k

点赞数

分类专栏： ctf 密码学 crypto

本文链接：https://blog.csdn.net/qq_33458986/article/details/100699263

版权

本文介绍了ByteCTF中一道密码题的解决过程，涉及RSA广播攻击和AES解密。题目通过先进行generate_init_state函数处理，然后用24次不同模数的低指数RSA加密和48次AES加密来保护flag。解题关键在于利用random函数的伪随机性获取AES秘钥，并通过反复执行generate_init_state函数找到原始flag。

摘要由CSDN通过智能技术生成

赛题下载链接：lrlr
下面是这道题的python代码部分：

from Crypto.Util.number import getPrime, bytes_to_long, long_to_bytes
from Crypto.Cipher import AES
import random


class lrand:

    def __init__(self, seed):
        self.seed = seed
        self.states = self.gen_states()
        self.statespoint = 0
        self.stateselse = 24

    def generate_init_state(self):
        a = 0
        for i in bin(self.seed)[2:]:
            a = a << 1
            if (int(i)):
                a = a ^ self.seed
            if a >> 256:
                a = a ^ 0x10000000000000000000000000000000000000000000000000000000000000223L
        return a

    def gen_states(self):
        init_state = self.generate_init_state()
        e = 17
        clist = []
        nlist = []
        for i in range(24):
            p = getPrime(512)
            q = getPrime(512)
            n = p * q
            c = pow(init_state, e, p * q)
            nlist.append(n)
            clist.append(c)
        f = open("cl", "wb")
        for i in nlist:
            f.write(hex(i) + "\n")
        return clist

    def stateconvert(self, state):
        key = long_to_bytes(random.getrandbits(