← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.760Z

imitive root of and a is any element of , then there exists a z such that gz = a (mod n).

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

x = y + kϕ(n) for some integer k, and thus gx = gy+kϕ(n) (mod n) = gy · (gϕ(n))k (mod n)

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea