Unformatted text preview: Thoughts on Key Escrow Acceptability,” TIS Report #534D, Trusted Information Systems, Nov 1994. 1581. S.T. Walker, S.B. Lipner, C.M. Ellison, D.K. Branstad, and D.M. Balenson, “Commercial Key Escrow—Something for Everyone—Now and for the Future,” TIS Report #541, Trusted Information Systems, Jan 1995. 1582. M.Z. Wang and J.L. Massey, “The Characteristics of All Binary Sequences with Perfect Linear Complexity Profiles,” Abstracts of Papers, EUROCRYPT ’86, 20–22 May 1986. 1583. E.J. Watson, “Primitive Polynomials (Mod 2),” Mathematics of Computation, v. 16, 1962, p. 368. 1584. P. Wayner, “Mimic Functions,” Cryptologia, v. 16, n. 3, Jul 1992, pp. 193–214. 1585. P. Wayner, “Mimic Functions and Tractability,” draft manuscript, 1993. 1586. A.F. Webster and S.E. Tavares, “On the Design of S–Boxes,” Advances in Cryptology—CRYPTO ’85 Proceedings, Springer–Verlag, 1986, pp. 523–534. 1587. G. Welchman, The Hut Six Story: Breaking the Enigma Codes, New York: McGraw–Hill, 1982. 1588. A.L. Wells Jr., “A Polynomial Form for Logarithms Modulo a Prime,” IEEE Transactions on Information Theory, Nov 1984, pp. 845–846. 1589. D.J. Wheeler, “A Bulk Data Encryption Algorithm,” Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer–Verlag, 1994, pp. 127–134. 1590. D.J. Wheeler, personal communication, 1994. 1591. D.J. Wheeler and R. Needham, “A Large Block DES–Like Algorithm,” Technical Report 355, “Two Cryptographic Notes,” Computer Laboratory, University of Cambridge, Dec 1994, pp. 1–3. 1592. D.J. Wheeler and R. Needham, “TEA, A Tiny Encryption Algorithm,” Technical Report 355, “Two Cryptographic Notes,” Computer Laboratory, University of Cambridge, Dec 1994, pp. 1–3. 1593. S.R. White, “Covert Distributed Processing with Computer Viruses,” Advances in Cryptology—CRYPTO ’89 Proceedings, Springer–Verlag, 1990, pp. 616–619. 1594. White House, Office of the Press Secretary, “Statement by the Press Secretary,” 16 Apr 1993. 1595. B.A. Wichman and I.D. Hill, “An Efficient and Portable Pseudo–Random Number Generator,” Applied Statistics, v. 31, 1982, pp. 188–190. 1596. M.J. Wiener, “Cryptanalysis of Short RSA Secret Exponents,” IEEE Tran...
View
Full Document
 Fall '10
 ALIULGER
 Cryptography, Bruce Schneier, Applied Cryptography, EarthWeb, Search Search Tips

Click to edit the document details