Legendre符号系统

都学点

于 2021-10-24 09:24:41 发布

阅读量918

点赞数

分类专栏：密码学文章标签： 1024程序员节信息安全判断二次同余解数学

本文链接：https://blog.csdn.net/u013671216/article/details/120929861

版权

密码学专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Legendre符号系统

定义

用于判定模p平方剩余

设p是素数，a是整数，legendre符号定义为
$(\frac{a}{p}) = \begin{cases} 1&,\text{若a是模p的平方剩余}\\ -1&,\text{若a是模p的平方非剩余}\\ 0&,\text{若p|a} \end{cases}$

判定

Euler判定法制

设P是奇素数，则对于任意整数a，有

$(\frac ap )= a^{\frac {p-1}2}(mod \quad p)$

使用模重复平方运算可快速判断
推论
1. $(\frac 1p) = 1$
2. $(\frac {-1}p ) = (-1)^{\frac {p-1}2}$
定理
p是奇素数
1. $(\frac ap) = (\frac{a+kp}{p})$
2. $(\frac{ab}{p}) = (\frac ap)(\frac bp)$
3. 若(a,p) = 1, 则 $(\frac{a^2}{p}) = 1$
4. $(\frac 2p)=(-1)^{\frac {p^2-1}{8}}$
二次互反律

设p，q是互素的奇素数

$(\frac qp) = (-1)^{\frac {p-1}{2}\bullet \frac{q-1}{2}}(\frac pq)$

算法实现

def l_fast(a, p):
    while a < 0:
        a = (a + p) % p
    if a == 0:
        return 0
    if a == 1:
        return 1
    e = 0
    a1 = a
    s = 0
    while a1 % 2 == 0:
        a1 = a1 // 2
        e = e + 1
    if e % 2 == 0:
        s = 1
    elif p % 8 == 1 or p % 8 == 7:
        s = 1
    elif p % 8 == 3 or p % 8 == 5:
        s = -1
    if p % 4 == 3 and a1 % 4 == 3:
        s = -s
    if a1 == 1:
        return s
    return s * l_fast(p % a1, a1)

public class Legendre {
    public int L_FAST(int a, int p) {
        while (a < 0) a = (a + p) % p;
        if (a == 0) return 0;
        if (a == 1) return 1;
        int e = 0, a1 = a, s = 0;
        while (a1 % 2 == 0) {
            a1 = a1 / 2;
            e++;
        }
        if (e % 2 == 0) s = 1;
        else {
            if (p % 8 == 1 || p % 8 == 7) s = 1;
            else if (p % 8 == 3 || p % 8 == 5) s = -1;
        }
        if (p % 4 == 3 && a1 % 4 == 3) s = -s;
        if (a1 == 1) return s;
        else return s * L_FAST(p % a1, a1);
    }
    public static void main(String[] args) {
        Legendre legendre = new Legendre();
        System.out.println(legendre.L_FAST(17, 37));
    }
}