chap04.htm
来自「应用密码学手册-英文版,学习密码学和网络安全的好资料。」· HTM 代码 · 共 31 行
HTM
31 行
<html>
<h4>
4.9 Algorithm <cite>Fermat primality test</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap04/fermat.c">
fermat.c</a> freelip (1,304)
<hr>
4.18 Algorithm <cite>Solovay-Strassen probabilistic
primality test</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap04/solovay.c">
solovay.c</a> freelip (1,665)
<hr>
4.24 Algorithm <cite>Miller-Rabin probabilistic
primality test</cite>
<a href="ftp://ftp.mindspring.com/users/pate/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="ftp://ftp.mindspring.com/users/pate/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="ftp://ftp.mindspring.com/users/pate/crypto/chap04/maurer.c">
maurer.c</a> freelip (2,715)
<hr>
4.69 Algorithm <cite>Testing a polynomial for irreducibility</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap04/genirred.c">
genirred.c</a> freelip (7,086)
</h4>
</html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?