[CryptoHack] MATHEMATICS-MODULAR MATH Write-Up

最新推荐文章于 2023-09-22 22:38:45 发布

dlfls

最新推荐文章于 2023-09-22 22:38:45 发布

阅读量5.4k

点赞数 1

分类专栏： CryptoHack 文章标签： python 数学

本文链接：https://blog.csdn.net/dlfls0710/article/details/119228473

版权

本文介绍了模数数学的四个关键概念：二次剩余，勒让德符号，模平方根以及中国剩余定理。通过举例和代码展示了解决相关问题的方法，如使用Tonelli-Shanks算法求解模平方根。

摘要由CSDN通过智能技术生成

MATHEMATICS-MODULAR MATH目录

1. Quadratic Residues

2. Legendre Symbol

3. Modular Square Root

4. Chinese Remainder Theorem

1. Quadratic Residues

推荐视频 Quadratic Residues

$a^2 = x\ (mod\ p)$

即,a^2>p时, (a^2-x)是p的倍数 (当a^2<p时, x = a^2)

$\therefore x=a^2-mp \ (a^2>p)$ (这里的mp代指p的倍数)

例子：

p=7
a += 1 
1^2 = 1 (mod 7) # 1<7, x=a^2=1
2^2 = 4 (mod 7) # 4<7, x=a^2=4
3^2 = 2 (mod 7) # 9>7, x=a^2-p*1=2
4^2 = 2 (mod 7) # 16>7, x=a^2-p*2=2
5^2 = 4 (mod 7) # 25>7, x=a^2-p*3=4
6^2 = 1 (mod 7) # 36>7, x=a^2-p*5=1
# 1,2,4 are Quadratic Residue of 7
# 3,5,6 are Quadratic Non-Residue of 7

题：

given:
p = 29
ints = x = [14,6,11]
find a^2, get a (always have two a values: +a and -a)

$\because x = a^2 - mp \ (a^2>p)$

$\therefore a^2 = x +mp$

原理：

a^2 = 6 + 29*2 = 64
a= 8, -8
flag = 8

代码：

p = 29
ints = [14,6,11]
print(min(x for x in range(p) if pow(x,2,p) in ints)) #8