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

4 jul 1980 pp 401406 717 me hellman another

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: a Communications,” RC 3663, Yorktown Heights, N.Y.: IBM Research, Dec 1971. 557. H. Feistel, W.A. Notz, and J.L. Smith, “Some Cryptographic Techniques for Machine to Machine Data Communications,” Proceedings of the IEEE, v. 63, n. 11, Nov 1975, pp. 1545–1554. 558. P. Feldman, “A Practical Scheme for Non–interactive Verifiable Secret Sharing,” Proceedings of the 28th Annual Symposium on the Foundations of Computer Science, 1987, pp. 427–437. 559. R.A. Feldman, “Fast Spectral Test for Measuring Nonrandomness and the DES,” Advances in Cryptology—CRYPTO ’87 Proceedings, Springer–Verlag, 1988, pp. 243–254. 560. R.A. Feldman, “A New Spectral Test for Nonrandomness and the DES,” IEEE Transactions on Software Engineering, v. 16, n. 3, Mar 1990, pp. 261–267. 561. D.C. Feldmeier and P.R. Karn, “UNIX Password Security—Ten Years Later,” Advances in Cryptology—CRYPTO ’89 Proceedings, Springer–Verlag, 1990, pp. 44–63. 562. H. Fell and W. Diffie, “Analysis of a Public Key Approach Based on Polynomial Substitution,” Advances in Cryptology—CRYPTO ’85 Proceedings, Springer–Verlag, 1986, pp. 427–437. 563. N.T. Ferguson, “Single Term Off–Line Coins,” Report CS–R9318, Computer Science/Department of Algorithms and Architecture, CWI, Mar 1993. 564. N.T. Ferguson, “Single Term Off–Line Coins,” Advances in Cryptology—EUROCRYPT ’93 Proceedings, Springer–Verlag, 1994, pp. 318–328. 565. N.T. Ferguson, “Extensions of Single–term Coins,” Advances in Cryptology—CRYPTO ’93 Proceedings, Springer–Verlag, 1994, pp. 292–301. 566. A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems,” Advances in Cryptology—CRYPTO ’86 Proceedings, Springer–Verlag, 1987, pp. 186–194. 567. A. Fiat and A. Shamir, “Unforgeable Proofs of Identity,” Proceedings of Securicom 87, Paris, 1987, pp. 147–153. 568. P. Finch, “A Study of the Blowfish Encryption Algorithm,” Ph.D. dissertation, Department of Computer Science, Cit...
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