知识卡片
离散对数是模幂运算的指数
给定模n本原根g及可逆剩余类a,满足g^z≡a(mod n)的指数z称a以g为底的离散对数。指数只需按φ(n)取模区分;定义依赖g确实生成整个可逆剩余类群。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
This z is a discrete logarithm or an index of a, modulo n, to the base g. We denote this value as indn,g(a). Theorem 31.33 (Discrete logarithm theorem) If g is a primitive root of , then the equation gx = gy (mod n) holds if and only if the equation x = y (mod ϕ(n)) holds. Proof Suppose first that x = y (mod ϕ(n)). Then, we have
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[50000,55000))。
- 结论依据:原文对中国剩余定理、模幂性质或重复平方法给出定理与算法;公式图已核对。
- 原始内容:This z is a discrete logarithm or an index of a , modulo n , to the base g . We denote this value as ind n , g ( a ). Theorem 31.33 (Discrete logarithm theorem) If g is a primitive root of , then the equation g x = g y (mod n ) holds if and only if the equation x = y (mod ϕ ( n )) holds. Proof Suppose first that x = y (mod ϕ ( n )). Then, we have