#CrewCTF_2022 #uninterested_challenge_list BRQDER1VHDkeVhQ5BRQfFhIJGw== >>> xor(b64decode(open("flag.enc", "rb").read()), "f") b'crew{3z_x0r_crypto}'

#CrewCTF_2022 from Crypto.Util.number import bytes_to_long, getRandomNBitInteger from Crypto.PublicKey import RSA from Crypto.Cipher import PKCS1_OAEP from Crypto.Hash import SHA256 from flag import FLAG key = RSA.generate(1024) p = key.p …

#CrewCTF_2022 ncすると一方的にメッセージが送られてくる how to factorize N given dするだけお def factorize(N, e, d): from math import gcd import gmpy2 k = d*e - 1 t = k while t % 2 == 0: t //= 2 g = 3 while True: x = pow(g, t, N) if x > 1: …

#CrewCTF_2022 import sys import random from hashlib import sha256 from Crypto.Util.number import inverse import ecdsa from secret import FLAG curve = ecdsa.curves.SECP112r1 p = int(curve.curve.p()) G = curve.generator n = int(curve.order) …

#CrewCTF_2022 #uninterested_challenge_list from Crypto.Util.number import getStrongPrime, inverse, bytes_to_long, GCD from random import randint from flag import flag p = getStrongPrime(512) q = getStrongPrime(512) n = p * q while True: d …

#CrewCTF_2022 #uninterested_challenge_list from Crypto.PublicKey import RSA from Crypto.Util.number import bytes_to_long import random import binascii from secret import flag e = 3 BITSIZE = 8192 key = RSA.generate(BITSIZE) n = key.n flag …

#CrewCTF_2022 from Crypto.Util.number import getPrime, bytes_to_long, inverse, isPrime from secret import flag m = bytes_to_long(flag) def getSpecialPrime(): a = 2 for i in range(40): a*=getPrime(20) while True: b = getPrime(20) if isPrime…

#CrewCTF_2022 FLAG = open('flag.txt', 'r').read().encode() p = 0x3981e7c18d9517254d5063b9f503386e44cd0bd9822710b4709c89fc63ce1060626a6f86b1c76c7cbd41371f6bf61dd8216f4bc6bad8b02a6cd4b99fe1e71b5d9ffc761eace4d02d737e5d4bf2c07ff7 m = 6 import …