长城杯2021 Crypto writeup

最新推荐文章于 2024-09-09 14:56:02 发布

M@ku1i

最新推荐文章于 2024-09-09 14:56:02 发布

阅读量603

点赞数 1

文章标签：密码学

本文链接：https://blog.csdn.net/weixin_56678592/article/details/120586024

版权

长城杯2021 Crypto writeup

#1 baby_rsa:

题目：

#!/usr/bin/env python3

from Crypto.Util.number import *
from secret import flag, v1, v2, m1, m2


def enc_1(val):
    p, q = pow(v1, (m1+1))-pow((v1+1), m1), pow(v2, (m2+1))-pow((v2+1), m2)
    assert isPrime(p) and isPrime(q) and (p*q).bit_length() == 2048 and q < p < q << 3
    return pow(val, 0x10001, p*q)


def enc_2(val):
    assert val.bit_length() < 512
    while True:
        fac = [getPrime(512) for i in range(3)]
        if isPrime(((fac[0]+fac[1]+fac[2]) << 1) - 1):
            n = fac[0]*fac[1]*fac[2]*