crypto-二元一次方程组(xctf)

最新推荐文章于 2024-10-17 11:39:06 发布

山猪儿烦不得

最新推荐文章于 2024-10-17 11:39:06 发布

阅读量629

点赞数

分类专栏： crypto 文章标签：算法 python 密码学

本文链接：https://blog.csdn.net/figfig55/article/details/128635495

版权

crypto 专栏收录该内容

53 篇文章 9 订阅

订阅专栏

RSA初级题，记录一下。
源码：

import libnum
from Crypto.Util import number
from secret import flag


size = 256
e = 65537
p = number.getPrime(size)
q = number.getPrime(size)
avg = (p+q)/2
n = p*q

m = libnum.s2n(flag)
c = pow(m, e, n)

print('n = %d' % n)
print('avg = %d' % avg)
print('c = %d' % c)

'''
n = 5700102857084805454304483466349768960970728516788155745115335016563400814300152521175777999545445613444815936222559357974566843756936687078467221979584601
avg = 75635892913589759545076958131039534718834447688923830032758709253942408722875
c = 888629627089650993173073530112503758717074884215641346688043288414489462472394318700014742820213053802180975816089493243275025049174955385229062207064503
'''

老套路，需要对 n 进行因子分解从而解密。
分析一下，因为 $avg=\frac{p+q}{2}$
则有 $p^2-2p \times avg = p^2 - p^2 - pq=-n$
同理 $q^2-2q \times avg = q^2 - q^2 - pq=-n$
于是可知 p,q 是方程 $x^2-2x \times avg +n=0$ 的解，老套路利用韦达定理求解即可。

最终exp：

#sage
from Crypto.Util.number import *
from gmpy2 import iroot

n = 5700102857084805454304483466349768960970728516788155745115335016563400814300152521175777999545445613444815936222559357974566843756936687078467221979584601
avg = 75635892913589759545076958131039534718834447688923830032758709253942408722875
c = 888629627089650993173073530112503758717074884215641346688043288414489462472394318700014742820213053802180975816089493243275025049174955385229062207064503
e = 65537

z = var('z')
delta = (2*avg)**2 - 4*n    
if iroot(delta, 2)[1] == True:
        sol = solve(z**2-2*avg*z+n==0, z, solution_dict=True)
        a, b = int(z.subs(sol[0])), int(z.subs(sol[1]))
        a, b = [a, b] if a > b else [b, a]
        p, q = a, b        
assert p * q == n
        
phi = (p-1) * (q-1)
d = pow(e, -1, phi)
m = int(pow(c, d, n))
print(long_to_bytes(m))