知识卡片
米勒拉宾找证据失败仍可能合数
米勒拉宾对选中的每个底数寻找合数证据;一旦找到即可确定为合数。
连续s次未找到只能作概率性素数判断,合数仍可能因抽到的底数都不是证人而漏检。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
Now, let’s examine the Miller-Rabin primality test based on how it uses the WITNESS procedure. As before, assume that n is an odd integer greater than 2. The procedure MILLER-RABIN is a probabilistic search for a proof that n is composite. The main loop (beginning on line 1) picks up to s random values of a from , except for 1 and n – 1 (line 2). If it picks a value of a that is a witness to the compositeness of n, then MILLER-RABIN returns COMPOSITE on line 4. Such a result is always
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[85000,90000))。
- 结论依据:原书第31.8节的素性判定方法、证人伪代码或定理;相关公式图已核对。
- 原始内容:Now, let’s examine the Miller-Rabin primality test based on how it uses the W ITNESS procedure. As before, assume that n is an odd integer greater than 2. The procedure M ILLER -R ABIN is a probabilistic search for a proof that n is composite. The main loop (beginning on line 1) picks up to s random values of a from , except for 1 and n – 1 (line 2). If it picks a value of a that is a witness to the compositeness of n , then M ILLER -R ABIN returns COMPOSITE on line 4. Such a result is always