密码学与网络安全 教学课件 作者 978 7 302 19727 0 附录K.pdfVIP

for70220_appK.fm Page 633 Tuesday, January 30, 2007 3:22 AM APPENDIX K Random Number Generator Cryptography and randomness are closely related. In Appendix F, Information Theory, we mentioned that perfect secrecy can be achieved if the key of the encipherment algo- rithm is truly a random number. There are two approaches to generating a long stream of random bits: using a natural random process, such as flipping a coin many times and interpreting heads and tails as 0-bits and 1-bits, or using a deterministic process with feedback. The first approach is called a true random number generator (TRNG); the second is called a pseudorandom number generator (PRNG). Figure K.1 shows these two approaches. Figure K.1 TRNG and PRNG Short Deterministic Long stream Repeated Random Long process stream experiments process stream Feedback a. TRGN b. PRNG K.1 TRNG Although flipping a fair coin continuously creates a perfect stream of bits, it is not prac- tical. There are man