Экспорт и импорт криптографии за рубежом 8 страница

559. R.A. Feldman, "Fast Spectral Test for Measuring Nonrandomness and the DES" Advances in Clyptology-CRYPTS '87 Proceedings, Springer-Verlag, 1988, pp. 243-254.

560. R.A. Feldrnan, "A New Spectral Test fol Nonrandomness and the DES," IEEE. Transactions on Software Engineering, v. 16, n. 3, Mar 1990, pp. 261-267.

561. D.C. Feldmeler and ER. Karn, "UNIX Password Security-Ten Years Later," Advances ill Cryptology-CRYPTS '85 Ploceedings, Springer-Verlag, 1990, pp.

562.. H. Fell and W. Diffle, "Analysis of a Public Key Approach Based on Polynomial Substitution," Advances in Clyptology- CRYPTO '85 Proceedings, Springer-Verlag, 1986, pp. 427-437.

563. N.T Ferguson, "Single Term Off-Line Coins," Report CS-R9318, Computer Scl once/Department of Algorithms ant? Architecture. CWI, Mar 1993.

564. N.T. Ferguson, "Single Term Off-Line Coins," Advances in Cryptology-EVRO- CRYPT '93 Proceedings, Springer-Verlag, 1994, pp. 318-328.

565. N.T Ferguson, "Extensions of Single-term Coins," Advances in Clyptology- CRYPTO '93 Proceedings, Springer-Verlag, 1994, pp. 292*01.

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 Encryp tion Algorithm," Ph.D. dissertation, Department of Computer Science, City University of New York Graduate School and University Center, Feb 1995.

569. R. Flynn and A.S. Carnpasano, "Data Dependent Keys for Selective Encryption Terminal," Proceedings ofNCC, vol. 47, AFIPS Press, 1978, pp. 1127-1129.

570. R.H. Follett. letter to NOT regarding DSS, 25Novl991.

571. R. Forre, "The Strict Avalanche Criterion: Spectral Properties and an Extended Definition," Advances in Cryptology- CRYPTO '88 Proceedings, Springer-Verlag, 1990.pp.450-468.

572. R. Forre, "A Fast Correlation Attack on Nonlinearity Feedforward Filtered Shift Register Sequences," Advances in Cryptology-CRYPTS '89 Proceedings, Springer-Verlag, 1990, pp. 568-595.

573. S. Fortune and M. Merritt, "Poker Protocols," Advances in Clyptology: Proceedings of CRYPTS 84, Springer-Verlag, 1985, pp. 454-464.

574. R.B. Fougner, "Public Key Standards and Licenses*" RFC 1170, ran 1991.

575. Y. Frankel and M. Yung, "Escrowed Encryption Systems Visited: Threats, Attacks, Analysis and Designs," Advances in Cryptology-CRYPTS '95 Proceedings, Springer-Verlag, 1995, to appear.

5 76. W.F. Friedman, Methods for the Solution of Running-Key Ciphers, Riverbank Publication No. 16, Riverbank Labs, 1918.

577. W.F. Friedman, The Index of Coincidence and Its Applications in Cryptography, Riverbank Publication No. 22, Riverbank Labs, 1920. Reprinted by Aegean Park Press, 1987.

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 Congruences," SIAM fouraal on Computing, v. 17, n. 2. Apr 1988, pp. 262-280.

581. A.M. Frieze, R. Kannan, and i.e. Lagarias, "Linear Congruential Generators Do not Produce Random Sequences," Proceedings of the 25th IEEE Symposium oil 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 SymPOSmm on Cryptography and Information Security iSCIS 92), Tateshina, Japan, 2-4 Apr 1994, pp. IA.l-12.

583. A. Fujioka, T. Okamoto, and S. Miyaguchi, "ESICN: An Efficient Digital Signature Implementation for Smart Cards," Advances in Cryptology-EUROCRYPT '91 Proceedings, Springer-Verlag, 1991, pp. 446*57.

584. A. Fujioka, T. Okamoto, and K. Ohta, "Interactive Bi-Proof Systems and Undeniable Signature Schemes," Advances in Cryptology-EUROCRYPT '91 Proceedings. Springer-Verlag, 1991, pp. 243-256.

585. A. Fuiioka, T. Okamoto, and K. Ohta, "A Practical Secret Voting Scheme for Large Scale Elections," Advances in Cryp- tology-AUSCRYPT '92 Proceedings, Springer-Verlag, 1993, pp. 244-251.

586. K. Caardner and E. Snekkenes, "Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol," Journal of Cryptology, v. 3, n. I, 1991, pp. 81-98.

587. H.F. Games, Cryptanalysis, American Photographic Press, 1937. (Reprinted by Dover Publications, 1956.1 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," Electronics Letters, v. 18, n. 16, 5 Aug 1982, pp. 706-707.

590. Z. Caul, 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. Gaul, S. Haber, and M. Yung, "Crypto- graphic Computation: Secure Fault- Tolerant Protocols and the Public-Key Model," Advances in Cryptology- CRYPTO '87 Proceedings, Springer-Verlag, 1988, pp. 135-155.

592. Z. Caul, S. Haber, and M. Yung, "Minimum-Knowledge Interactive Proofs for Decision Problems," SIAM Journal on Computing, v. 18, n. 4, 1989, pp. 711-739.

593. R.C. Callager, Information Theory and Reliable Communications, New York: John Wiley & Sons, 1968.

594. P. Callay 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 2°-' + n + I," fournal of Combinatorical Theory. Series A, v. 34, n. 2, Mar 1983, pp. 248-25 1.

596. R.A. Games and A.H. Chan, "A Fast Algorithm for Determining the Complexity of a Binary Sequence with 2°," IEEE Transactions on Information Theory, v. IT-29, n. I, Jan 1983, pp. 144-146.

597. R.A. Games, A.H. Chan, and E.L. Key, "On the Complexity of de Bruijn Sequences," Journal of Combinatorical Theory, Series A, v. 33, n. I, Nov 1982, pp. 233-246.

598. S.H. Gao and C.L. Mullen, "Dickson Polynomials and Irreducible Polynomials over Finite Fields," Journal of Number Theory, v. 49, n. I, Oct 1994, pp. 18-132.

599. M. Cardner, "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. Carfinkel, Pep: Pretty Good Privacy, Sebastopol, CA: O'Reilly and Associates, 1995.

602. C.W Cardiner, "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. C. Caron and R. Outerbridge, "DES Watch: An Examination of the Sufficiency of the Data Encryption Standard for Financial Institution Information Security in the 1990's," Cryptologia. v. 15, n. 3, Jul 1991, pp. 177-193.

604. M. Casser, A. Coldstein, C. Kaufman, and B. Lampson, "The Digital Distributed Systems Security Architecture," Proceedings of the 12th National Computer Security Conference, NIST, 1989, pp. 305-319.

605. J. von zur Cathen, D. Kozen, and S. Landau, "Functional Decomposition of Polynomials," Proceedings o* tile 28th IEEE Symposium on the Foundations of Com- puter Science, IEEE Press, 1987, pp. 127-131.

606. P.R. Geffe, "How to Protect Data With Ciphers That are Really Hard to Break," Electronics, v. 46, n. I, 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, )M. Lucassen, and S.T. Berlin, "The Application of Digital Broad­cast Communication to Large Scale Infor­mation Systems," IEEE fournal on Selected Areas in Communications, v. 3, n. 3, May 1985, pp. 457-467.

609. D.K. Gifford and D.A. Segal, "Boston Com­munity Information System 1987-1988 Experimental Test Results," MIT/LCS/ TR-422, MIT Laboratory for Computer Sci­ence, 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 P. 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-A? Operations," Advances in Cryptol­ogy—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. Cl and C3.

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

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

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

617. 0. Goldreich and E. Kushilevitz, "A Per­fect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm," Advances in Cryptology—CRYPTO '88 Proceedings, Springer-Verlag, 1990, pp 58-70.

618. 0. Goldreich and E. Kushilevitz, "A Per­fect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm," /our- nal of Cryptology, v. 6, n. 2, 1993, pp. 97-116.

619. 0. Goldreich, S. Micali, and A. Wigderson, "Proofs That Yield Nothing but Their Validity and a Methodology of Crypto­graphic Protocol Design," Proceedings of the 27th IEEE Symposium on the Founda­tions of Computer Science, 1986, pp. 174-187.

620. 0. Goldreich, S. Micali, and A. Wigderson, "How to Prove All NP Statements in Zero Knowledge and a Methodology of Crypto­graphic Protocol Design," Advances ill Cryptology—CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp. 171-185.

621. 0. 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. 0. Goldreich, S. Micali, and A. Wigderson, "Proofs That Yield Nothing but Their Validity and a Methodology of Crypto­graphic Protocol Design," fournal of the ACM, v. 38, n. I, ful 1991, pp. 691-729.

623. S. Goldwasser and ]. 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," fournal of Computer and System Sciences, v. 28, n. 2, Apr 1984, pp. 270-299.

626. S. Goldwasser, S. Micali, and C. Rackoff, "Tht 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 Journal on Computing, v. 18, n. I, 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 fournal on Computing, v. 17, n. 2, Apr 1988, 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 GF(g) Sequences," IEEE Transactions on Information Theory, v. IT-35, n. I, Jan 1989, pp. 69-75.

631. J.D. Golic, "Linear Cryptanalysis of Stream Ciphers," K.U. Leuven Workshop on Cryptographic Algorithms, Springer-Verlag, 1995, pp. 262-282.

632. J.D. Golic, "Towards Fast Correlation Attacks on Irregularly Clocked Shift Regis­ters," 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," fournal of Cryptology, v. 3, n. 3, 1991, pp. 201-212.

634. J.D. Golic and L. O'Connor, "Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers," Ad­vances in Cryptology—EUROCRYPT '94 Proceedings, 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 The­ory Symposium. Cornell, 1994, to appear.

636. D. Gollmann, "Kaskadenschaltungen takt-gesteuerter Schieberegister als Pseudozu-faliszahlengeneratoren," 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 III, M.J. Ganley, ed., 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 Cryptol­ogy—EUROCRYPT '88 Proceedings, Springer-Verlag, 1988, pp. 331-343.

641. D. Gollmann and W.G. Chambers, "Clock-Controlled Shift Registers: A Review," IEEE fournal on Selected Areas in Com­munications, v. 7, n. 4, May 1989, pp. 525-533.

642. D. Gollmann and W.G. Chambers, "A Cryptanalysis of Step)„m-cascades," Ad­vances 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. I, 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 Re­search in Security and Privacy, 1991, pp. 234-248.

646. R.M. Goodman and AJ. MeAuley, "A New Trapdoor Knapsack Public Key Cryptosys­tem," Advances in Cryptology: Proceed­ings of EUROCRYPT 84, Springer-Verlag, 1985, pp. 150-158.

647. R.M. Goodman and A.J. MeAuley, "A New Trapdoor Knapsack Public Key Cryptosys­tem," IEE 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 1991.

649. D.M. Gordon and K.S. McCurley, "Com­putation of Discrete Logarithms in Fields of Characteristic Two," presented at the rump session of CRYPTO '91, Aug 1991.

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

651. J.A. Gordon, "Strong Primes are Easy to Find," Advances in Cryptology: Proceed­ings of EUROCRYPT 84, Springer-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," Elec­tronics Letters, v. 12, n. 25, 9 Dee 1976, pp. 663-664.

653. J.A. Gordon and R. Retkin, "Are Big S-Boxes Best?" Cryptography, 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 Cryp­tology—EUROCRYPT '94 Proceedings, Springer-Verlag, 1995, to appear.

655. COST, Gosudarstvennyi Standard 28147-89, "Cryptographic Protection for Data Processing Systems," Government Com­mittee of the USSR for Standards, 1989. (In Russian.)

656. COST R 34.10-94, Gosudarstvennyi Stan­dard of Russian Federation, "Information technology. Cryptographic Data Security. Produce and check procedures of Elec­tronic Digital Signature based on Asym­metric Cryptographic Algorithm." Gov­ernment Committee of the Russia, 1994. (In Russian.)

657. COST R 34.11-94, Gosudarstvennyi Stan­dard of Russian Federation, "Information technology. Cryptographic Data Security. Hashing function." Government Commit­tee of the Russia, 1994. (In Russian.)

658. R. Gottfert and H. Neiderreiter, "On the Linear Complexity of Products of Shift-Register Sequences," Advances in Cryp­tology—EUROCRYPT '93 Proceedings, Springer-Verlag, 1994, pp. 151-158.

659. R. Gottfert and H. Neiderreiter, "A Gen­eral Lower Bound for the Linear Complex­ity of the Product of Shift-Register Sequences," Advances in Cryptology— EUROCRYPT '94 Proceedings, Springer-Verlag, 1995, to appear.

660. J. van de Graaf and R. Peralta, "A Simple and Secure Way to Show the Validity of Your Public Key," Advances in Cryptol­ogy—CRYPTO '87 Proceedings, Springer-Verlag, 1988, pp. 128-134.

661. ]. GrollmanandA.L. Selman, "Complexity Measures for Public-Key Cryptosystems," Proceedings of the 25th IEEE Symposium on the Foundations of Computer Science 1984, pp. 495-503.

662. GSA Federal Standard 1026, "Telecommu­nications: General Security Requirements for Equipment Using the Data Encryption tion, Apr 1982.

663. GSA Federal Standard 1027, "Telecommu­nications: Interoperability and Security Requirements for Use of the Data Encryp­tion Standard in the Physical and Data Link Layers of Data Communications," General Services Administration, fan 1983.

664. GSA Federal Standard 1028, "Interoper­ability and Security Requirements for Use of the Data Encryption Standard with CCITT Group 3 'Facsimile Equipment," General Services Administration, Apr 1985.

665. P. Guam, "Cellular Automaton Public Key Cryptosystems," Complex Systems, v. I, 1987, pp. 51-56.

666. H. Guan, "An Analysis of the Finite Automata Public Key Algorithm," CHI-NACRYPT '94, Xidian, China, 11-15 Nov 1994, pp. 120-126. (In Chinese.)

667. G. Guanella, "Means for and Method for Secret Signalling," U.S. Patent #2,405,500, 6 Aug 1946.

668. M. Gude, "Concept for a High-Performance Random Number Generator Based on Physical Random Phenomena," Frequenz, v. 39, 1985, pp. 187-190.

669. M. Gude, "Ein quasi-idealer Gleichverteil-ungsgenerator basierend auf physikalis-chenZufallsphanomenen," Ph.D. disserta­tion, Aachen University of Technology, 1987. (In German.)

670. L.C. Guillou and ].-]. Quisquater, "A Prac­tical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory," Advances in Cryptology— EURO CRYPT '88 Proceed­ings, Springer-Verlag, 1988, pp. 123-128.

671. L.C. Guillou and 1.-1. Quisquater, "A 'Para­doxical' Identity-Based Signature Scheme Resulting from Zero-Knowledge," Ad­vances in Cryptology—CRYPTO '88 Pro­ceedings, Springer-Verlag, 1990, pp. 216- » 231.

672. L.C. Cuillou, M. Ugon, and ].-]. Quis­quater, "The Smart Card: A Standardized Security Device Dedicated to Public Cryp-tology," Contemporary Cryptology: The Science of Information Integrity, G. Sim-mons, ed., IEEE Press, 1992, pp. 561-613.

673. C.G. Gunther, "Alternating Step Genera­tors Controlled by de Bruijn Sequences," Advances in Cryptology—EUROCRYPT '87 Proceedings, Springer-Verlag, 1988, pp. 5-14.

674. C.G. Gunther, "An Identity-based Key-exchange Protocol," Advances in Cryptol­ogy—EUROCRYPT '89 Proceedings, Springer-Verlag, 1990, pp. 29-37.

675. H. Gustafson, E. Dawson, and B. Caelli, "Comparison of Block Ciphers," Advances in Cryptology—AUSCRYPT '90 Proceed­ings, Springer-Verlag, 1990, pp. 208-220.

676. P. Gutmann, personal communication, 1993.

677. H. Gutowitz, "A Cellular Automaton Cryptosystem: Specification and Call for Attack," unpublished manuscript, Aug 1992.

678. H. Gutowitz, "Method and Apparatus for Encryption, Decryption, and Authentica­tion Using Dynamical Systems," U.S. Patent #5,365,589, 15 Nov 1994.

679. H. Gutowitz, "Cryptography with Dynam­ical Systems," Cellular Automata and Cooperative Phenomenon, Kluwer Aca­demic Press, 1993.

680. R.K. Guy, "How to Factor a Number," Fifth Manitoba Conference on Numeral Mathematics Congressus Numerantium, v. 16, 1976, pp. 49-89.

681. R.K. Guy, Unsolved Problems in Number Theory, Springer-Verlag, 1981.

682. S. Haber and W.S. Stornetta, "How to Time-Stamp a Digital Document," Advances in Cryptology—CRYPTO '90 Proceedings, Springer-Verlag, 1991, pp. 437-455.

683. S. Haber and W.S. Stornetta, "How to Time-Stamp a Digital Document," Journal of Cryptology, v. 3, n. 2, 1991, pp. 99-112.

684. S. Haber and W.S. Stornetta, "Digital Doc­ument Time-Stamping with Catenate Cer­tificate," U.S. Patent #5,136,646, 4 Aug 1992.

685. S. Haber and W.S. Stornetta, "Method for Secure Time-Stamping of Digital Docu­ments," U.S. Patent #5,136,647, 4 Aug 1992.

686. S. Haber and W.S. Stornetta, "Method of Extending the Validity of a Cryptographic Certificate," U.S. Patent #5,373,561, 13 Dee 1994.

687. T. Habutsu, Y. Nishio, 1. Sasase, and S. Mori, "A Secret Key Cryptosystem by Iter­ating a Chaotic Map," Transactions of the Institute of Electronics, Information, and Communication Engineers, v. E73, n. 7, Jul 1990, pp. 1041-1044.

688. T. Habutsu, Y. Nishio, 1. Sasase, and S. Mori, "A Secret Key Cryptosystem by Iter­ating a Chaotic Map," Advances in Cryp­tology—EUROCRYPT '91 Proceedings, Springer-Verlag, 1991, pp. 127-140.

689. S. Hada and H. Tanaka, "An Improvement Scheme of DES against Differential Crypt-analysis, " Proceedings of the 1994 Sympo­sium on Cryptography and Information Security (SCIS 94), Lake Biwa, lapan, 27-29 Jan 1994, pp 14A.I-11. (In Japanese.)

690. B.C.W. Hagelin, "The Story of the Hagelin Cryptos," Cryptologia, v. 18, n. 3, Jul 1994, pp. 204-242.

691. T. Hansen and G.L. Mullen, "Primitive Polynomials over Finite Fields," Mathe­matics of Computation, v. 59, n. 200, Oct 1992, pp. 639-643.

692. S. Harada and S. Kasahara, "An lD-Based Key Sharing Scheme Without Preliminary Communication," IEICE Japan, Technical Report, ISEC89-38, 1989. (In Japanese.)

693. S. Harari, "A Correlation Cryptographic Scheme," EUROCODE '90—Interna­tional Symposium on Coding Theory, Springer-Verlag, 1991, pp. 180-192.

694. T. Hardjono and J. Seberry, "Authentication via Multi-Service Tickets in the Kuperee Server," Computer Security—ESORICS 94, Springer-Verlag, 1994, pp. 144-160.

695. L. Ham and T. Kiesler, "New Scheme for Digital Multisignatures," Electronics Let­ters, v. 25, n. 15, 20 Jul 1989, pp. 1002-1003.

696. L. Ham and T. Kiesler, "Improved Rabin's Scheme with High Efficiency," Electronics Letters, v. 25, n. 15, 20 Jul 1989, p. 1016.

697. L. Ham and T. Kiesler, "Two New Effi­cient Cryptosystems Based on Rabin's Scheme," Fifth Annual Computer Security Applications Conference, IEEE Computer Society Press, 1990, pp. 263-270.

698. L. Ham and D.-C. Wang, "Cryptanalysis and Modification of Digital Signature Scheme Based on Error-Correcting Codes," Electronics Letters, v. 28, n. 2, 10 Jan 1992, p. 157-159.

699. L. Ham and Y. Xu, "Design of Centralized EIGamal Type Digital Signature Schemes Based on Discrete Logarithm," electronics Letters, v. 30, n. 24, 24 Nov 1994, p. 2.025-1026.

700. L. Ham and S. Yang, "Croup-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party," Advances in Cryptology- AUSCRYPT '92 Proceedings, Springer- Verlag, 1993.pp. 133-142.

701. G. Harper, A. Menezes, and S. Vanstone, "Public-Key Cryptosystems with Very Small Key Lengths," Advances in Cryptol- ogy-EUROCRYPT '92 Proceedings, Springer-Verlag, 1993, pp. 163-173.

702. C. Harpes, "Notes on High Order Differen­tial Cryptanalysis of DBS," internal report, Signal and Information Processing Labora­tory, Swiss Federal Institute of Technol­ogy, Aug 1993.

703. C.W. Hart, "To Decode Short Cryp­tograms," Communications by the ACM, v. 37, n. 9, Sep 1994, pp. 102-108.

704. J. Hastad, "On Using RSA with Low Expo­nent in a Public Key Network," Advances m Clyptology-CRYPTO '85 Proceedings, Springer-Verlag, 1986, pp. 403-408.

705. J. Hastad and A. Shamir, "The Crypto- graphic Security of Truncated Linearly Related Variables," Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 356-362.

706. R.C. Hauser and E.S. Lee, "Verification and Modelling of Authentication Protocols," ESORICS 92, Proceedings of the Second European Symposium on Research in Computer Security, Springer-Verlag, 1992, pp. 131-154.

707. B. Hayes, "Anonymous One-Time Signa­tures and Flexible Untraceable Electronic Cash," Advances in Cryptology- AUSCRYPT '90 Proceedings, Springer- Verlag, 1990, pp. 294-305.

708. D.K. He, "LUC Public Key Cryptosystem and its Properties," CHINACRYPT '94, Xidian, China, 11-15 Nov 1994, pp. 60-69. lln Chinese.)

709. T. He and T. Kiesler, "Enhancing the Secu­rity of EICamal's Signature Scheme," IEE Proceedings on Computers and Digital Techniques, v. 141, n. 3, 1994, pp. 193-193.

710. E.H. Hebern, "Electronic CodingMachine," U.S. Patent #l.510.441, 30 Sep 1924.

711. N. Heintze and J.D. Tygar, "A Model for Secure Protocols and their Compositions," Proceedings of the 1994 IEEE Computer Society Symposium on Research in Secu­rity and Privacy, 1994, pp. 2-13.

712. M.E. Hellman, "An Extension of the Shan­non Theory Approach to Cryptography," IEEE Transactions oa Information Theory, v.IT-23.n.3.Mayl977.pp.289-294.

713. M.E. Hellman, "The Mathematics of Pub­lic-Key Cryptography," Scientific Ameri­can, v. 241, n. 8, Aug 1979, pp. 146-157.

714. M.E. Hellman, "DES Will Be Totally Inse­cure within Ten Years," IEEE Spectrum, v. 16, n. 7, Jul 1979, pp. 32-39.

715. M.E. Hellman, "On DBS-Based Syn­chronous Encryption," Dept. of Electrical Engineering, Stanford University, 1980. 716. M.E. Hellman, "A Cryptanalytic Time- Memory Trade Off," IEEE Transactions on Information Theory, v. 26, n. 4, lul 1980, pp. 401-406.