applied cryptography - protocols, algorithms, and source code in c

Applied cryptography protocols algorithms and source code in c

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: AT&ampT Technical Journal, v. 63, n. 8, Oct 1984, pp. 1673–1683. 1300. T. Renji, “On Finite Automaton One–Key Cryptosystems,” Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer–Verlag, 1994, pp. 135–148. 1301. T. Renji and C. Shihua, “A Finite Automaton Public Key Cryptosystems and Digital Signature,” Chinese Journal of Computers, v. 8, 1985, pp. 401–409. (In Chinese.) 1302. T. Renji and C. Shihua, “Two Varieties of Finite Automaton Public Key Cryptosystems and Digital Signature,” Journal of Computer Science and Tecnology, v. 1, 1986, pp. 9–18. (In Chinese.) 1303. T. Renji and C. Shihua, “An Implementation of Identity–based Cryptosystems and Signature Schemes by Finite Automaton Public Key Cryptosystems,” Advances in Cryptology—CHINACRYPT ’92, Bejing: Science Press, 1992, pp. 87–104. (In Chinese.) 1304. T. Renji and C. Shihua, “Note on Finite Automaton Public Key Cryptosystems,” CHINACRYPT ’94, Xidian, China, 11–15 Nov 1994, pp. 76–80. 1305. Research and Development in Advanced Communication Technologies in Europe, RIPE Integrity Primitives: Final Report of RACE Integrity Primitives Evaluation (R1040), RACE, June 1992. 1306. J.M. Reyneri and E.D. Karnin, “Coin Flipping by Telephone,” IEEE Transactions on Information Theory, v. IT–30, n. 5, Sep 1984, pp. 775–776. 1307. P. Ribenboim, The Book of Prime Number Records, Springer–Verlag, 1988. 1308. P. Ribenboim, The Little Book of Big Primes, Springer–Verlag, 1991. 1309. M. Richter, “Ein Rauschgenerator zur Gewinnung won quasi–idealen Zufallszahlen für die stochastische Simulation,” Ph.D. dissertation, Aachen University of Technology, 1992. (In German.) 1310. R.F. Rieden, J.B. Snyder, R.J. Widman, and W.J. Barnard, “A Two–Chip Implementation of the RSA Public Encryption Algorithm,” Proceedings of GOMAC (Government Microcircuit Applications Conference), Nov 1982, pp. 24–27. 1311. H. Riesel, Prime Numbers and Computer Methods for...
View Full Document

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Ask a homework question - tutors are online