一、crypto
1.easy-real
打开题目
import random
import hashlib
flag = 'xxxxxxxxxxxxxxxxxxxx'
key = random.randint(1,10)
for i in range(len(flag)):
crypto += chr(ord(flag[i])^key)
m = crypto的ascii十六进制
e = random.randint(1,100)
print(hashlib.md5(e))
p = 64310413306776406422334034047152581900365687374336418863191177338901198608319
q = xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
n = p*q
c = pow(m,e,n)
print(n)
print(c)
#37693cfc748049e45d87b8c7d8b9aacd
#4197356622576696564490569060686240088884187113566430134461945130770906825187894394672841467350797015940721560434743086405821584185286177962353341322088523
#3298176862697175389935722420143867000970906723110625484802850810634814647827572034913391972640399446415991848730984820839735665233943600223288991148186397
注释中三段数字分别对应三个输出
首先求e
import hashlib
import random
for e in range(1,100):
if hashlib.md5(str(e).encode()).hexdigest() =='37693cfc748049e45d87b8c7d8b9aacd':
print(e)
break
求出e=23
然后解出m,flag
import random
import hashlib
import math
from Crypto.Util.number import inverse, long_to_bytes
n = 4197356622576696564490569060686240088884187113566430134461945130770906825187894394672841467350797015940721560434743086405821584185286177962353341322088523
c = 3298176862697175389935722420143867000970906723110625484802850810634814647827572034913391972640399446415991848730984820839735665233943600223288991148186397
p = 64310413306776406422334034047152581900365687374336418863191177338901198608319
q = n // p
e = 23
phi = (q - 1) * (p - 1)
d = inverse(e, phi)
m = pow(c, d, n)
m=long_to_bytes(m)
print(m)
m='ndios_;9kgE;WK8e;W?gWn<\\;k|nu'
for key in range(10):
flag = ""
for i in range(len(m)):
flag += chr(ord(m[i]) ^ key)
print(flag)