原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
the problems of the simple procedure PSEUDOPRIME with two modifications: It tries several
randomly chosen base values a instead of just one base value. While computing each modular exponentiation, it looks for a nontrivial square root of 1, modulo n, during the final set of squarings. If it finds one, it stops and returns COMPOSITE. Corollary 31.35 from Section 31.6 justifies detecting composites in this manner. The pseudocode for the Miller-Rabin primality test appears in the procedures MILLER-RABIN and W
ITNESS. The input n > 2 to MILLER-RABIN is the odd number to be tested for primality, and
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea