d#

1
from Crypto.Util.number import *
2
from flag import flag
3

4
p = bytes_to_long(flag)
5
assert isPrime(p)
6
q = getPrime(256)
7
d = pow(65537, -1, (p - 1) * (q - 1))
8
print(d)
9
# 22800184635336356769510601710348610828272762269559262549105379768650621669527077640437441133467920490241918976205665073

1
from Crypto.Util.number import *
2
from sympy import mod_inverse
3

4
e = 65537
5
d = 22800184635336356769510601710348610828272762269559262549105379768650621669527077640437441133467920490241918976205665073
6

7

8
k = e * d - 1
9

10
print(k)

1
1494255700446038813603416304291116907852512020860105389680719273898055792355796087321348579564087105168984643943590671889200

1
prime_factors = {
2
    2: 4,
3
    3: 1,
4
    5: 2,
5
    37: 1,
6
    1117: 1,
7
    4029461: 1,
8
    1403014978139: 1,
9
    284368748316481195117: 1,
10
    18741210882440665187461519398960291465361283084482741278982029639876282810203: 1
11
}
12

13
def find_factors(prime_factors):
14
    factors = {1}
15
    for prime, exponent in prime_factors.items():
16
        current_factors = set(factor * (prime ** i) for factor in factors for i in range(exponent + 1))
17
        factors.update(current_factors)
18
    return sorted(factors)
19

20
f = find_factors(prime_factors)
21
print(f)
22

23
for i in f:
24
    n = i + 1
25
    print(n)
26
    if isPrime(n):
27
        flag = long_to_bytes(n)
28
        if b'DH{' in flag:
29
            print(flag)
30
            break

1
DH{too_small_n..3}