576.W.F. Friedman, Methods for the Solution of Running-Key Ciphers, Riverbank Publica-

tion No. 16, Riverbank Labs, 1918.

577.W.F. Friedman, The Index of Coincidence and Its Applications in Cryptography,

Riverbank Publication No. 22, Rivcrhank Labs, 1920. Reprinted by Aegean Park Press,

578.W.F. Friedman, Elements of Cryptanalysis, Laguna Hills, CA: Aegean Park Press, 1976.

579.W.F. Friedman, "Cryptology," Encyclopedia Britannica, v. 6, pp. 844-851, 1967.

580.A.M. Frieze, J. Hastad, R. Kannan, J.C. Lagarias, and A. Shamir, "Reconstructing

Truncated Integer Variables Satisfying Linear Congru enccs," SIAM Journal on Computing,

v. 17, n. 2, Apr 1988, pp. 262-280.

581.A.M. Frieze, R. Kannan, and J.C. Lagarias, "Linear Congruential Generators loo not

Produce Random Sequences," Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, 1984, pp. 480 484.

582.E. Fujiaski and T. Okamoto, "On Comparison of Practical Digitial Signature Schemes,"

Proceedings of the 1992 Symposium on Cryptography and Information Security (SCIS 92), Tateshina, Japan, 2 4 Apr 1994, pp. lA.1-12.

583.A. Fujioka, T. Okamoto, and S. Miyaguchi, "ESIGN: An Efficient Digital Signature

Implementation for Smart Cards, " Advances in Cryptology EUROCRYPT 91 Proceedings, Springer-Verlag, 1991, pp. 446 457.

584.A. Fujioka, T. Okamoto, and K. Ohta, "Interactive Bi-Proof Systems and Undeniable

Signature Schemes," Advances in Cryptology EU ROCRYPT 91 Proceedings, Springer-

Verlag, 1991, pp. 243-256.

585.A. Fujioka, T. Okamoto, and K. Ohta, "A Practical Secret Voting Scheme for Large Scale

Elections, " Advances in Cryptology AUSCRYPT 92 Proceedings, Springer-Verlag, 1993,

pp. 244-251.

586.K. Gaardner and E. Snekkenes, "Applying a Formal Analysis Technique to the CCITT

X.509 Strong Two-Way Authentication Protocol," lournal of Cryptology v. 3,n.2, l991,pp.81-98.

587.H.E Gaines, Cryptanalysis, American Photographic Press, 1937. Reprintcd by Dover

Publications, 1956.

588.J. Gait, "A New Nonlinear Pseudorandom Number Generator, " IEEE Transactions on

Software Engineering, v. SE-3, n. 5, Sep 1977, pp. 359-363.

589.J. Gait, "Short Cycling in the Kravitz-Reed Public Key Encryption System," Electron- ics

Letters, v. 18, n. 16, 5 Aug 1982, pp. 706-707.

590.Z. Galil, S. Haber, and M. Yung, "A Private Interactive Test of a Boolean Predicate and

Minimum-Knowledge Public-Key Cryp- tosystems," Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985, pp. 360-371.

591.Z. Galil, S. Haber, and M. Yung, "Crypto- graphic Computation: Secure Fault- Tolerant

Protocols and the Public-Key Model, " Advances in Cryptology CRYPTO 87Proceedings, Springer-Verlag, 1988, pp. 135-155.

592.Z. Galil, S. Haber, and M. Yung, "Mini- mum-Knowledge Interactive Proofs for Decision

Problems, " SIAM lournal on Computing, v. 18, n. 4, 1989, pp. 711-739.

593.R.G. Gallager, Information Theory and Reliable Communications, New York:John Wiley &

Sons, 1968.

594.P. Gallay and E. Depret, "A Cryptography Microprocessor," 1988 IEEE International

Solid-State Circuits Conference Digest of Technical Papers, 1988, pp. 148-149.

595.R.A. Games, "There are no de Bruijn Sequences of Span n with Complexity 2n + n + 1,"

Journal of Combinatorical Theory, Series A, v. 34, n. 2, Mar 1983, pp. 248-251.

596.R.A. Games and A.H. Chan, "A Fast Algo- rithm for Determining the Complexity of a

Binary Sequence with 2n,t IEEE Transactions on Information Theory, v. IT-29, n. 1, Jan 1983, pp. 144-146.

597.R.A. Games, A.H. Chan, and E.L. Key, "On the Complexity of de Brui jn Sequences,"

ournal of Combinatorical Theory, Series A, v. 33, n. 1, Nov 1982, pp. 233-246.

598.S.H. Gao and G.L. Mullen, "Dickson Polynomials and Irreducible Polynomials over Finite

Fields," Journal of Number Theory, v. 49, n. 1, Oct 1994, pp. 18-132.

599.M. Gardner, "A New Kind of Cipher That Would Take Millions of Years to Break,"

Scientific American, v. 237, n. 8, Aug 1977, pp. 120-124.

600.M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of

NP-Completeness, W.H. Freeman and Co., 1979.

601.S.L. Garfinkel, POP: Pretty Good Privacy, Sebastopol, CA: OReilly and Associates, 1995.

602.C.W. Gardiner, "Distributed Public Key Certificate Management," Proceedings of the

Privacy and Security Research Group 1993 Workshop on Network and Distributed System Security, The Internet Society, 1993, pp. 69-73.

603.G. Garon and R. Outerbridge, "DES Watch: An Examination of the Sufficiency of the Data

Encryption Standard for Finan- cial Institution Information Security in the 1990s," Cryptologia, v. 15, n. 3, Jul 1991, pp. 177-193.

604.M. Gasser, A. Goldstein, C. Kaufman, and B. Lampson, "The Digital Distributed Sys-

tems Security Architecture," Proceedings of the 12th National Computer Seezznty Conference, NIST, 1989, pp. 305-319.

605.J. von zur Gathen, D. Kozen, and S. Lan- dau, "Functional Decomposition of Polynomials, " Proceedings of the 28tl1 IEEE Symposium on the Poundations of Computer Science, IEEE Press, 1987, pp. 127617. 131.

606.RR. Geffe, "How to Protect Data With Ciphers That are Really Hard to Break,"

Electronics, v. 46, n. 1, Jan 1973, pp. 99-101.

607.D.K. Gifford, D. Heitmann, D.A. Segal, R.G. Cote, K. Tanacea, and D.E. Burmas- ter,

"Boston Community Information Sys- tem 1986 Experimental Test Results, " MIT/LCS/TR-397, MIT Laboratory for Computer Science, Aug 1987.

608.D.K. Gifford, J.M. Lucassen, and S.T. Berlin, "The Application of Digital Broadcast

Communication to Large Scale Information Systems, " IEEE Journal on Selected Areas in Communications, v. 3, n. 3, May 1985, pp. 457-467.

609.D.K. Gifford and D.A. Segal, "Boston Community Information System 1987-1988

Experimental Test Results," MIT/LCS/ TR-422, MIT Laboratory for Computer Science,

May 1989.

610.H. Gilbert and G. Chase, "A Statistical Attack on the Feal-8 Cryptosystem, " Advances in

Cryptology CRYPTO 90 Proceedings, Springer-Verlag, 1991, pp. 22-33

611.H. Gilbert and R Chauvaud, "A Chosen Plaintext Attack of the 16-Round Khufu

Cryptosystem," Advances in Cryptol- ogy CRYPTO 94 Proceedings, Springer-Verlag,

1994, pp. 259-268.

612.M. Girault, "Hash-Functions Using Mod- ulo-N Operations," Advances in Cryptology

EUROCRYPT 87 Proceedings, Springer-Verlag, 1988, pp. 217-226.

613.J. Gleick, "A New Approach to Protecting Secrets is Discovered, " The New York Times, 18 Feb 1987, pp. C1 and C3.

614.J.-M. Goethals and C. Couvreur, "A Crypt analytic Attack on the Lu-Lee Public-Key Cryptosystem, " Philips lournal of Re search, v. 35, 1980, pp. 301-306.

615.O. Goldreich, "A Uniform-Complexity Treatment of Encryption and Zero Knowledge, Journal of Cryptology, v. 6, n. 1, 1993, pp. 21-53.

616.O. Goldreich and H. Krawczyk, "On the Composition of Zero Knowledge Proof Systems," Proceedings on the 17th Inter national Colloquium on Automata, Languages, and Programming, Springer" Verlag, 1990, pp. 268-282.