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

Schoenmakers m schunter l valle and m waidner digital

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: 5. D. Balenson, “Automated Distribution of Cryptographic Keys Using the Financial Institution Key Management Standard,” IEEE Communications Magazine, v. 23, n. 9, Sep 1985, pp. 41–46. 76. D. Balenson, “Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers,” RFC 1423, Feb 1993. 77. D. Balenson, C.M. Ellison, S.B. Lipner, and S.T. Walker, “A New Approach to Software Key Escrow Encryption,” TIS Report #520, Trusted Information Systems, Aug 94. 78. R. Ball, Mathematical Recreations and Essays, New York: MacMillan, 1960. 79. J. Bamford, The Puzzle Palace, Boston: Houghton Mifflin, 1982. 80. J. Bamford and W. Madsen, The Puzzle Palace, Second Edition, Penguin Books, 1995. 81. S.K. Banerjee, “High Speed Implementation of DES,” Computers & Security, v. 1, 1982, pp. 261–267. 82. Z. Baodong, “MC–Veiled Linear Transform Public Key Cryptosystem,” Acta Electronica Sinica, v. 20, n. 4, Apr 1992, pp. 21–24. (In Chinese.) 83. P.H. Bardell, “Analysis of Cellular Automata Used as Pseudorandom Pattern Generators,” Proceedings of 1990 International Test Conference, pp. 762–768. 84. T. Baritaud, H. Gilbert, and M. Girault, “FFT Hashing is not Collision–Free,” Advances in Cryptology—EUROCRYPT ’92 Proceedings, Springer–Verlag, 1993, pp. 35–44. 85. C. Barker, “An Industry Perspective of the CCEP,” 2nd Annual AIAA Computer Security Conference Proceedings, 1986. 86. W.G. Barker, Cryptanalysis of the Hagelin Cryptograph, Aegean Park Press, 1977. 87. P. Barrett, “Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor,” Advances in Cryptology—CRYPTO ’86 Proceedings, Springer–Verlag, 1987, pp. 311–323. 88. T.C. Bartee and D.I. Schneider, “Computation with Finite Fields,” Information and Control, v. 6, n. 2, Jun 1963, pp. 79–98. 89. U. Baum and S. Blackburn, “Clock–Controlled Pseudorandom Generators on Finite Groups,” K.U. L...
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