617.O. Goldreich and E. Kushilevitz, "A Perfect Zero-Knowledge Proof for a Problem

Equivalent to Discrete Logarithm, " Advances in Cryptology CRYPTO 88 Iroceedings, Springer-Verlag, 1990, pp. 58-70.

618.O. Goldreich and E. Kushilevitz, "A Per- fect Zero-Knowledge Proof for a Problem

Equivalent to Discrete Logarithm," lour- nal of Cryptology, v. 6, n. 2, law, pp. 97-116.

619.O. Goldreich, S. Micali, and A. Wigderson, "Proofs That Yield Nothing but Their Validity

and a Methodology of Cryptographic Protocol Design," Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, 1 986, pp. 174-187.

620.O. Goldreich, S. Micali, and A. Wigderson, "How to Prove All NP Statements in Zero

Knowledge and a Methodology of Cryptographic Protocol Design, " Advances in Cryptology CRYPTO 8 6 Proceedings, Springer-Verlag, 1987, pp. 171-185.

621.O. Goldreich, S. Micali, and A. Wigderson, "How to Play Any Mental Game," Pro-

ceedings of the 19th ACM Symposium on the Theory of Computing, 1987, pp. 218-229.

622.O. Goldreich, S. Micali, and A. Wigdcrson, "Proofs That Yield Nothing but Their Validity

and a Methodology of Crypto- graphic Protocol Design," Journal of the ACM, v. 38, n. 1,

Jul 1991, pp. 691-729.

623.S. Goldwasser and J. Kilian, "Almost All Primes Can Be Quickly Certified, " Pro- ceedings

of the 18th ACM Symposium on the Theory of Computing, 1986, pp. 316- 329.

624.S. Goldwasser and S. Micali, "Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information," Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982, pp. 270-299.

625.S. Goldwasser and S. Micali, "Probabilistic Encryption," Journal of Computer and System

Sciences. v. 28, n. 2, Apr 1984, pp. 270-299.

626.S. Goldwasscr, S. Micali, and C. Rackoff, "The Knowledge Complexity of Interac- tive

Proof Systems, " Proceedings of the 17th ACM Symposium on Theory of Com- puting, 1985, pp. 291-304.

627.S.Goldwasser, S. Micali, and C. Rackoff, "The Knowledge Complexity of Interac tive

Proof Systems, " SIAM lournal on Computing, v. 18, n. 1, Feb 1989, pp. 186 208.

628.S. Goldwasser, S. Micali, and R.L. Rivest, "A Digital Signature Scheme Secure Against

Adaptive Chosen-Message Attacks," SIAM lournal on Computing, v. 17,n.2,Aprl988,pp.281-308.

629. S. Goldwasser, S. Micali, and A.C. Yao, "On Signatures and Authentication," Advances in Cryptology: Proceedings of Crypto 82, Plenum Press, 1983, pp. 211-215.

630.J.D. Golic, "On the Linear Complexity of Functions of Periodic GFIq~ Sequences," IEEE

Transactions on Information Theory, v. IT-35, n. 1. Jan 1989, pp. 69-75.

631.J.D. Golic, "Linear Cryptanalysis of Stream Ciphers," K.U. Le uven Workshop on

Cryptographic Algorithms, Springer Verlag, 1995, pp. 262-282.

632.J.D. Golic, "Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers,"

Advances in Cryptology EURO CRYPT 95 Proceedings, Springer-Verlag, 1995, to appear.

633.J.D. Golic and M.J. Mihajlevic, "A Gener alized Correlation Attack on a Class of Stream

Ciphers Based on the Levenshtein Distance, " journal of Cryptology, v. 3, n.3, 1991, pp.

201-212.

634.J.D. Golic and L. OConnor, "Embedding and Probabilistic Correlation Attacks on Clock-

Controlled Shift Registers," Advances in Cryptology EUROCRYPT 94 Iroceedings, Springer-Verlag, 1995, to appear.

635.R. Golliver, A.K. Lenstra, K.S. McCurley, "Lattice Sieving and Trial Division," Pro

ceedings of the Algorithmic Number Theory Symposium, Cornell, 1994, to appear.

636.D. Gollmann, "Kaskadenschaltungen takt gesteuerter Schicberegister als Pseudozu

fallszahlengencratoren," Ph.D. disserta tion, Universitat Linz, 1983. (In German).

637.D. Gollmann, "Pseudo Random Properties of Cascade Connections of Clock Con trolled

Shift Registers," Advances in Cryp tology: Proceedings of EUROCRYPT 84, Springer-

Verlag, 1985, pp. 93-98.

638.D. Gollmann, "Correlation Analysis of Cascaded Sequences," Cryptography and Coding,

H.J. Beker and F.C. Piper, eds., Oxford: Clarendon Press, 1989, pp. 289-297.

639.D. Gollmann, "Transformation Matrices of Clock-Controlled Shift Registers, "

Cryptography and Coding 111, M.J. Ganley, e d., Oxford: Clarendon Press, 1993, pp.

197-210.

640.D. Gollmann and W.G. Chambers, "Lock-In Effect in Cascades of Clock-Controlled Shift-

Registers, " Advances in Cryptology EUROCRYPT 88 Proceedings, Springer-Verlag, 1988, pp. 331-343.

641.D. Gollmann and WG. Chambers, "Clock-Controlled Shift Registers: A Review, " IEEE

lournal on Selected Areas in Communications, v. 7, n. 4, May 1989, pp. 525-533.

642.D. Gollmann and W.G. Chambers, "A Cryptanalysis of Step-cascades," Advances in

Cryptology EUROCRYPT 89 Proceedings, Springer-Verlag, 1990, pp. 680-687.

643.S.W. Golomb, Shift Register Sequences, San Francisco: Holden-Day, 1967. (Reprinted by

Aegean Park Press, 1982.

644. L. Gong, "A Security Risk of Depending on Synchronized Clocks, " Operating Systems Review, v. 26, n. 1, Jan 1992, pp. 49-53.

645.L. Gong, R. Needham, and R. Yahalom, "Reasoning About Belief in Cryptographic

Protocols," Proceedings of the 1991 IEEE Computer Society Symposium on Research in

Security and Privacy, 1991, pp. 234-248.

646.R.M. Goodman and A.J. McAuley, "A New Trapdoor Knapsack Public Key Cryptosys-

tem," Advances in Cryptology: Proceedings of EUROCRYPT 84, Springer-Verlag, 1985, pp. 150-158.

647.R.M. Goodman and A.J. McAuley, "A New Trapdoor Knapsack Public Key Cryptosystem,"

IKE Proceedings, v. 132, pt. E, n. 6, Nov 1985, pp. 289-292.

648.D.M. Gordon, "Discrete Logarithms Using the Number Field Sieve," Preprint, 28 Mar

649.D.M. Gordon and K.S. McCurley, "Computation of Discrete Logarithms in Fields of

Characteristic Two," presented at the rump session of CRYPTO91, Aug 1991.

650.D.M. Gordon and K.S. McCurley, "Massively Parallel Computation of Discrete Logarithms, " Advances in Cryptology CRYPTO 92 Proceedings, Springer-Verlag, 661. 1993, pp. 312-323.

651.J.A. Gordon, "Strong Primes are Easy to Find," Advances in Cryptology: Proceedings of

EUROCRYPT 84, Sp ringer-Verlag, 1985, pp. 216-223.

652.J.A. Gordon, "Very Simple Method to Find the Minimal Polynomial of an Arbitrary Non-

Zero Element of a Finite Field, " Electronics Letters, v. 12, n. 25, 9 Dec 1976, pp. 663664.

653.J.A. Gordon and R. Retkin, "Are Big S- Boxes Best7" Cryptograph y Proceedings of the

Workshop on Cryptography, Burg Feuerstein, Germany, March 29-April 2, 1982, Springer-Verlag, 1983, pp. 257-262.

654.M. Goresky and A. Klapper, "Feedback Registers Based on Ramified Extension of the 2-

adic Numbers," Advances in Cryptology EUROCRYPT 94 Proceedings, Springer-Verlag, 1995, to appear.

655.GOST, Gosudarstvennyi Standard 28147-89, "Cryptographic Protection for Data

Processing Systems," Government Committee of the USSR for Standards, 1989. ( in Russian.}

656.GOST R 34.10-94, Gosudarstvennyi Standard of Russian Federation, "Information

technology. Cryptographic Data Security. Produce and check procedures of Electronic