📄 chap03.htm

📁 应用密码学这本书的源代码

💻 HTM

字号:

<html>
<h4>
3.14 Algorithm <cite>Pollard's p - 1 algorithm for
 factoring integers</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/pminone.c">
 pminone</a> freelip (5,665)
<hr>
3.21 Algorithm <cite>Quadratic sieve algorithm for
 factoring integers</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/mpqs.c">
 mpqs.c</a> freelip (13,128)
<hr>
3.34 Algorithm <cite>Finding square roots modulo a prime p</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/sqrtmod.c">
 sqrtmod.c</a> (3,090)
<hr>
3.44 Algorithm <cite>Finding square roots modulo n given
 its prime factors p and q</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/fsroots.c">
 fsroots.c</a> freelip (3,749)
<hr>
3.56 Algorithm <cite>Baby-step giant-step for computing
 discrete logarithms</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/dlp.c">
 dlp.c</a> (5,234)
<hr>
3.60 Algorithm <cite>Pollard's rho algorithm for computing
 discrete logarithms</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/dlp.c">
 dlp.c</a> (5,234)
<hr>
3.68 Algorithm <cite>Index-calculus algorithm for discrete
 logarithms in cyclic groups</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/index.c">
 index.c</a> freelip (11,083)
<hr>
3.105 Algorithm <cite>Solving subset problems using LLL-algorithm
</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/knapsack.c">
 knapsack.c</a> (5,373)
<hr>
3.108 Algorithm <cite>Finding a delta-quality simultaneous
 diophantine approximation</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/intlll.c">
 intlll.c</a> (9,120)
<hr>
3.111 Algorithm <cite>Berlekamp's Q-matrix algorithm for
 factoring polynomials over finte fields</cite>
<a href="ftp://ftp.mindspring.com/users/pate/crypto/chap03/polyfact.c">
 polyfact.c</a> freelip (12,831)
</h4>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C

搜索代码 Ctrl + F

全屏模式 F11

切换主题 Ctrl + Shift + D

显示快捷键 ?

增大字号 Ctrl + =

减小字号 Ctrl + -