题目在这里
1.Spirit{82345640850222370423166502918}
用威尔逊定理
(p-1)! + 1 = 0 (mod p)
(p-1)(p-2)! = -1 (mod p)
(p-2)! = 1 (mod p)
(p-2333)! = (p-2)!(p-2)-1(p-3)-1(p-4)-1…(p-2332)-1=(p-2)-1(p-3)-1(p-4)-1…(p-2332)-1 (mod p)
from Crypto.Util.number import *
p =6754809195983416889371518438404230464318771258362527973287334033265667200119099459184180646680169474847824019197256829826149222241090098845978570412659797
res = 1
for i in range(2,2333):
res = res*inverse(p-i,p)
res %= p
print("Spirit{{{}}}".format(res%(2**100)))
2.Spirit{950e2c584008bb9ceb30049cf36a40bc}
考察位运算
from Crypto.Util.number import *
enc = 696190889020604856890193198853561201348825165171326836202150445122902404137656377702109518236445
tmp = enc
for i in range(enc.bit_length()//23):
tmp = enc ^ tmp >> 23
print(long_to_bytes(tmp))
3.Spirit{easy_reverse_just__repeat_it_!!}
用到a % 2n = a & (2n-1)和第二题
from Crypto.Util.number import *
enc = 1050202800288756594888207862919284086044293654918425636192291797436341243157293011540594049798
mask1 = 3698415493855604199601451107484163420720646551661606649093806737041154400431942060340531696401
mask2 = 3460949362284136053271491912952156811286686375965162899233783178191434976143378804364416056910
a, b, c, d = 15, 27, 19, 23
bit = mask1.bit_length()
y = enc
tmp = y
for i in range(bit//d):
tmp = y ^ tmp >> d
y = tmp
for i in range(bit//c):
tmp = y ^ tmp << c & mask2
y = tmp
for i in range(bit//b):
tmp = y ^ tmp << b & mask1
y = tmp
for i in range(bit//a):
tmp = y ^ tmp >> a
y = tmp
y = y & ((2 << bit)-1)
print(long_to_bytes(y))
4.Spirit{final__lcg__is__co0m1ing__are_you_ready?}