📄 chap04.html
字号:
<html><h4>4.9 Algorithm <cite>Fermat primality test</cite><a href="fermat.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/fermat.c"> fermat.c</a> freelip (1,304)<hr>4.18 Algorithm <cite>Solovay-Strassen probabilistic primality test</cite><a href="solovay.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/solovay.c"> solovay.c</a> freelip (1,665)<hr>4.24 Algorithm <cite>Miller-Rabin probabilistic primality test</cite><a href="miller.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/miller.c"> miller.c</a> freelip (1,832)<hr>4.53 Algorithm <cite>Gordon's algorithm for generating a strong prime</cite><a href="gordon.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/gordon.c"> gordon.c</a> freelip (1,676)<hr>4.62 Algorithm <cite>Maurer's algorithm for generating provable primes</cite><a href="maurer.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/maurer.c"> maurer.c</a> freelip (2,715)<hr>4.69 Algorithm <cite>Testing a polynomial for irreducibility</cite><a href="genirred.c" tppabs="http://www.mindspring.com/%7Epate/crypto/chap04/genirred.c"> genirred.c</a> freelip (7,086)</h4></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -