Bibliography

＿1ａG. AGNEW, T. BETH, R. MULLIN AND S. VANSTONE, "Arithmetic operations in GF(2m)", Journal      of Cryptology, to appear, 1993

＿2ａG. AGNEW, R. MULLIN, I. ONYSZCHUK AND S. VANSTONE, "An implementation for a fast            public-key cryptosystem", Journal of Cryptology, 3 (1991), 63-79.

＿3ａG. AGNEW, R. MULLIN AND S. VANSTONE, "An implementation of elliptic curve cryptosystems      over[eqn: {F}_{2}^{155}], IEEE Journal on Selected Areas in Communications, to appear.

＿4ａD. ASH, I. BLAKE AND S. VANSTONE, "Low complexity normal bases", Discrete Applied            Mathemtics, 25 (1989), 191-210.

＿5ａA. ATKIN, "The number of points on an elliptic curve modulo a prime", manuscript, 1991.

＿6ａA. ATKIN, personal communication, 1992.

＿7ａA. ATKIN AND F. MORAIN, "Elliptic curves and primality proving", Mathematics of Computation,      to appear, 1993.

＿8ａE. BACH, "Number theoretic algorithms", Annual Review in Computer Science, 4 (1990), 119-

172.

＿9ａA. BENDER AND G. CASTAGNOLI, "On the implementation of elliptic curve cryptosystems",           Advances in Cryptology-CRYPTO'89, Lecture Notes in Computer Science, 435 (1990), Springer-

Velag, 417-426.

＿10ａM. BEN-OR, "Probabilistic algorithms in finite fields", 22nd Annual Symposium on Foundations       of Computer Science, 394-398, 1981.

＿11ａT. BETH, "Efficient zero-knowledge identification scheme for smart cards", Advances in            Cryptology-EUROCRYPT'88, Lecture Notes in Computer Science, 330 (1988), Springer-Verlag,       77-84.

＿12ａT.BETH AND F. SCHAEFER, "Non supersingular elliptic curves for public keycryptosystems",       Advances in Cryptology-EUROCRYPT'91, Lecture Notes in Computer Science, 547 (1991),          Springer-Verlag, 316-327.

＿13ａE. BIHAM AND A. SHAMIR, "Differential cryptanalysis of the full 16-round DES", Advances in       Cryptology-CRYPTO'92, to appear.

＿14ａM.BLUM AND S. MICALI, "How to generate cryptographically strong sequences of pseudo

random biths", SLAM Journal on Computing, 13 (1984), 850-864.

＿15ａB.DEN BOER, "Dirrie-Hellman is as strong as discrete log for certain primes", Advances in          Cryptology-CRYPTO'88, Lecture Notes in Computer Science, 403 (1990), Springer Verlag,           530-539.

＿16ａG. BRASSARD, Modern Cryptology: A Tutorial, Springer-Verlag, Berlin, 1988.

＿17ａE. BRICKELL, D. GORDON, K. McCURLEY AND D. WILSON, "Fast exponentiation with                precomputation", Advances in Cryptology - EU - ROCRYPT'92, to appear.

＿18ａE. BRICKELL, AND K. MCCURLEY, "An interactive identification scheme based on discrete          logarithms and factoring",  Journal of Cryptology, 5 (1992), 29-39.

＿19ａJ. BRILLHART, D. LEHMER, J. SELFRIDGE, B. TUCKERMAN AND S. WAGSTAFF, "Factorizations of       bn±1, b=2,3,5,6,7,10,11,12 up to high powers", Contemporary Mathematics, 22, 1983.

＿20ａJ. BUCHMANN AND V. MULLER, "Computing the number of points of elliptic curves over           finite fields", presented at International Symposium on Symbolic and Algebraic Computation,         Bonn, July 1991.

＿21ａJ. BUCHMANN AND H. WILLIAMS, "A key-exchange system based on imabinary quadratic            fields" Journal of Cryptology, 1 (1988), 107-118.

＿22ａJ. CASSELS, Lectures on Elliptic Curves, Cambridge University Press, 1991.

＿23ａD. CANTOR, "On the analogue of the division polynomials for hyperelliptic curves I", preprint,       1992.

＿24ａJ. CHAHAL, Topics in Number Theory, Plenum Press, New York, 1988.

＿25ａL. CHARLAP, R. COLEY AND D. ROBBINS, "Enumeration of rational points on elliptic curves          over finite fields", preprint, 1991.

＿26ａL. CHARLAP AND D. ROBBINS, "An elementary introduction to elliptic curves", CRD Expository       Report No.31, Institute for Defense Analysis Princeton, December 1988.

＿27ａB. CHOR AND R. RIVEST, "A knapsack-type public key cryptossystem based on arithmetic in        finite fields", IEEE Transaction on Information Theory, 34 (1988), 901-909.

＿28ａD. CHUDNOVSKY AND G. CHUDNOVSKY, "Sequences of numbers generated by addition in formal       groups and new primality and factoring tests", Advances in Applied Mathematics, 7 (1987),         385-434.

＿29ａD. COPPERSMITH, "Fast evaluation of logarithms in fields of characteristic two", IEEE              Transactions on Information Theory, 30 (1984), 587-594.

＿30ａD. COPPERSMTIH, A. ODLYZKO AND R. SCHROEPPEL, "Discrete logarithms in GF(p)",              Algorithmica, 1 (1986), 1-15.

＿31ａR. CRANDALL, "Method and apparatus for public key exchange in a cryptographic system",          U.S. patent number 5, 159, 632, October 1992.

＿32ａM. DEURING, "Die typen der multiplikatorenringe elliptischer funktionenk□rper", Abh. Math.          Sem. Univ. Hamburg, 14 (1941), 197-272.

＿33ａM. DIAB, "Systolic architectures for multiplication over finite field GF(2m)", Proceeding of          AAECC-9, Lecture Notes in Computer Science, 508 (1991), Springer-Verlag, 329-340.

＿34ａW. DIFFIE, "The first ten years of public key cryptography", in [144], 135-175.

＿35ａW. DIFFIE AND M. HELLMAN, "New directions in cryptography", IEEE Transactions on             Information Theory, 22 (1976), 644-654.

＿36ａY. DRIENCOURT AND J. MICHON, "Elliptic codes over a field of characteristic 2", Journal of          Pure and Applied Algebra, 45 (1987), 15-39.

＿37ａS. DUSS□ AND B. KALISKI, "A cryptographic library for the Motorola DSP56000", Advances in       Cryptology-EUROCRYPT'90, Lecture Notes in Computer Science, 473 (1991), Springer-Verlag,       230-244.

＿38ａH. EBERLE, "A high-speed DES implementation for network applications", Advances in              Cryptology-CRYPTO'92, to appear.

＿39ａT. ELGAMAL, "A public key cryptosystem and a signature scheme based on discrete                logarithms", IEEE Transactions on Information Theory, 31 (1985), 469-472.

＿40ａT. ELGAMAL, "A subexponential-time algorithm for computing discrete logarithms over             GF(p2)", IEEE Transactions on Information Theory, 31 (1985), 473-481.

＿41ａM. FENG, "A VLSI architecture for fast inversion in GF(2m)", IEEE Transactions in               Computer, 38 (1989), 1383-1386.

＿42ａA. FIAT AND A. SHAMIR, "How to prove yourself: Practical solutions to identification and            signature problems", Advances in Cryptology-CRYPTO'86, Lecture Notes in Computer Science,       293 (1987), SPringer-Verlag, 186-194.

＿43ａG. FREY AND H. R□CK, "A remark concerning m-divisibility and the discrete logarithm in the       divisor class group of curves", Mathematics of Computation, to appear.

＿44ａW. FULTON, Algebraic Curves, Benjamin, New York, 1969.

＿45ａS. GAO AND H.W.Lenstra, "Optimal normal bases", Designs, Codes and Cryptography, 2 (1992),       315-323.

＿46ａG. VAN DER GEER, "Codes and elliptic curves", in Effective Mehtods in Algebraic Geometry,        Birkh□user, 1991, 159-168.

＿47ａW. GEISELMANN AND D. GOLLMANN, "VLSI design for exponentiation in GF(2n)", Advances in       Cryptology-AUSCRYPT'90, Lecture Notes in Computer Science, 453 (1990), Springer-Verlag,,       398-405.

＿48ａS. GOLDWASSER AND J. KILIAN, "Almost all primes can be quickly certified", Proceedings           of the Eighteenth Annual ACM Symposium on Theory, of Computing, 316-329, 1986.

＿49ａS. GOLDWASSER AND S. MICALI, "Probabilistic encryption", Journal of Computer and                System Sciences, 28 (1984), 270-299.

＿50ａD. GORDON, "Discrete logarithms in GF(pn) using the number field sieve", SIAM Journal on       Discrete Mathematics, to appear.

＿51ａD. GORDON, "Discrete logarithms in GF(pn) using the number field sieve", preprint, 1991.

＿52ａD. GORDON AND K. MCCURLEY, "Massively parallel computation of dicrete  logarithms",           Advances in Cryptology-CRYPTO'92, to appear.

＿53ａL. GUILLOU, M. UGON AND J. QUISQUATER, "The smart card: a standardized security device         dedicated to public cryptology", in [144], 561-613.

＿54ａG. HARPER, A. MENEZES AND S. VANSTONE, "Public-key cryptosystem with very small             key lengths", Advances in Cryptology-EURO-CRYPT'92, to appear.

＿55ａJ. HASTAD, "On using RSA with low exponent in a public key network", Advances in              Cryptology-CRYPTO'85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag,           403-408.

＿56ａM. HELLMAN AND M. REYNERI, "Fast computation of discrete logarithms in GF(q)□,Advance         in Cryptology- CRYPTO'82, Plenum Press, 1983, 3-13.

＿57ａM. HUANG AND D. UERARDI, "Efficient algorithms for the riemann-Roch problem and for            addition in the jacobian of a curve", 3lst Annual Symposium on Foundations of Computer           Science, 678-687, 1991.

＿58ａD. HUSEM□LLER, Elliptic Curves, Springer-Verlag, New York, 1987.

＿59ａT. ITOH, O. TEECHAI AND S. TSUJII, "A fast algorithm for computing multiplicative                 inverse in GF(2t) using normal bases" (in Japanes), J. Society for Electronic Communication        (Japan), 44 (1986), 31-36.

＿60ａP. IVEY, S. WALKER, J. STERN AND S. DAVIDSON, "An ultra-high speed public key encryption

processor", Proceedings of IEEE Custorm Integrated Circuits Conference, Boston, 1992, 19.6.1

-19.6.4.

＿61ａD. JUNGNICKEL, Finite Fields: Structure and Arithmetics, Bibliographisches Institut,                Mannheim, 1993.

＿62ａB. KALISKI, "A pseudorandom bit generator based on elliptic logarithms", Advances in              Cryptology-CRYPTO'86, Lecture Notes in Computer Science, 293 (1987), Springer-Verlag,           84-103.

＿63ａB. KALISKIM "Elliptic curves and cryptography: A pseudorandom bit generator and other            tools", Ph. D. thesis, M.I.T., January 1988.

＿64ａB. KALISKIM, "One-way permutations on elliptic curves", Journal of Cryptology, 3 (1991),           187-199.

＿65ａC. KIT AND R,. LIDL, "On implementing elliptic curve cryptosystems", Contributions to            General Algebra, 6 (1988), 155-166.

＿66ａN. KOBLITZ, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, New            York, 1984.

＿67ａN. KOBLI, "Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.

＿68ａN. KOBLITZ, A Course in Number Theory and Cryptography, Springer-Verlag, New York,          1987.

＿69ａN. KOBLITZ, "Primality of the number of points on all elliptic curve over a finite field",             Pacific Journal of Mathematics, 131 (1988), 157-165.

＿70ａN. KOBLITZ, "Hyperelliptic cryptosystems", Journal of Cryptology, 1 (1989), 139-150.

＿71ａN. KOBLITZ, "Constructing elliptic curve cryptosystems in characteristic 2", Advances in            Cryptology-CRYPTO'90, Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 156-

167.

＿72ａN. KOBLITZ, "Elliptic curve implementation of zero-knowledge blobs", Journal of Cryptology,

4 (1991), 207-213.

＿73ａN. KOBLITZ, "CM-curves with good cryptographic properties", Advances in Cryptology-          CRYPTO'91, Lecture Notes in Computer Science, 576 (1992), Springer-Verlag, 279-287.

＿74ａK. KOYAMA, U. MAURER, T. OKAMOTO AND S. VANSTONE, "New public-key schemes       based on elliptic curves over the ring[eqn: {Z}_{pq}]", IEEE Transactions on Information Theory, to          appear.

＿75ａK. KOYAMA AND Y. TSURUOKA, "Speedign up elliptic cryptosystems using a signed binary           window method", Advances in Cryptology-CRYOTO'92, to appear.

＿76ａB. LA MACCHIA AND A. ODLYZKO, "Computation of discete logarithms in prime fields",              Design, Codes and Cryptographym 1 (1991), 47-62.

＿77ａS. LANG, Elliptic Curves: Diophantine Analysis, Springer-Verlag, 1978.

＿78ａA. LENSTRA, H.W. LENSTRA, "Algorithms in number theory", in Handbook of Theoretical           Computer Science, vol. A, Algorithms and Complexity, MIT Press, Cambridge, 1990, 673-715.

＿79ａA. LENSTRA, H.W. LENSTRA, M. MANASE AND J. POLLARD, "The number field sieve",               Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing,              564-572, 1990.

＿80ａH.W. LENSTRA, "Factoring integers with elliptic curves", Annals of Mathematics, 126 (1987),        649-673.

＿81ａH.W. LENSTRA, "Elliptic curves and number-theoretic algorithms", Proceedings of the Inter-

national Congress of Mathematicians, American Mathematical Society, Providence, RI, 1988,          99-120.

＿82ａH.W. LENSTRA AND C. POMERANCE, "A rigorous time bound for factoring integers", Journal of       the American Mathematical Society, 5 (1992), 483-516.

＿83ａR. LIDL AND H. NIEDERREITER, Finite Fields, Cambridge University Press, 1987.

＿84ａR. LOVORN, "Rigorous subexponential algorithms for discrete logarithms over finite fields", Ph.       D. thesis, University of Georgia, 1992.

＿85ａK. MCCURLEY, "A key distribution system equivalent to factoring", Journal of Cryptology, 1       (1988), 95-105.

＿86ａK. MCCURLEY, "Cryptographic key distribution and computation in class groups", in Number       Theory and Applications, Proceedings of the NATO Advanced Study Institute on Number           Theory and Applications, Richard Mollin, ed., Kluwer, Boston, 1989.

＿87ａK. MCCURLEY, "The discrete lgartihm problem", Cyrptology and Computational Number           Theory, Proceeding of Symposia in Applied Mathematics, 42 (1990). 49-74.

＿88ａR. MCELIECE, "A public-key cryptosystem based on algebraic coding theory", DSN Progress       Report 42-44, Jet Propulsion Laboratory, 1978, 114-116.

＿89ａR. J. MCELIECE, Finite Fields for Computer Scientists and Engineers, Kluwer Academic          Publishers, 1987.

＿90ａW. MEIER AND O. STAFFELBACH, "Efficient multiplication on certain non-supersingular elliptic       curves", Advances in Cryptology-CRYPTO'92, to appear.

＿91ａA. MENEZES(EDITOR), I. BLAKE, X. GAO, R. MULLIN, S. VANSTONE AND T. YAGHOOBIANM           Applications of Finite Fields, Kluwer Academic Publishers, 1992.

＿92ａA. MENEZES, T.OKAMOTO AND S. VANSTONE, "Reducing elliptic curve logarithms to logarithms       in a finite field", IEEE Transactions on Information Theory, to appear.

＿93ａA. MENEZES AND S. VANSTONE, "The implementation of elliptic curve cryptosystems",              Advances in Cryptology-AUSCRYPT'90, Lecture Note In Computer Science, 453 (1990),             Springer-Verlag, 2-13.

＿94ａA. MENEZES AND S. VANSTONE, "Isomorphism classes of elliptic curves over finite fields of         characteristic 2", Utilitas Mathematica, 38 (1990), 135-154.

＿95ａA. MENEZES AND S. VANSTONE, "A note on cyclic groups, finite fields, and the discrete             logarithm problem", Applicable Algebra in Engineering, Communication and Computing, 3           (1992), 67-74.

＿96ａA. MENEZES AND S. VANSTONE, "Elliptic curve cryptosystems and their implementation",           Journal of Cryptology, to appear.

＿97ａA. MENEZED, S. VANSTOE AND R. ZUCCHERATO, "Counting points on elliptic curves over[eqn: {F}_{2}^{m}],       Mathematics of Computation, 60 (1993), 407-420.

＿98ａG. MENICHETTI, "Roots of affine polynomials", Annals of Discrete Mathematics, 30 (1986),          303-310.

＿99ａR. MERKLE, "A certified digital signature", Advances in Cryptology-CRYPTO'89, Lecture           Notes in Computer Science, 218 (1986), Springer-Verlag, 218-238.

＿100ａV. MILLER, "Uses of elliptic curves in crytography", Advances in Cryptology-CRYPTO'85,         Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417-426.

＿101ａV. MILLER, "Short programs for functions on curves", unpublished manuscript, 1986.

＿102ａC. MITCHELL, F. PIPER AND P. WILD, "Digital signatures", in [144], 325-378.

＿103ａA.MIYAJI, "On ordinary elliptic curves", Advances in Cryptology-ASIACRYPT'91, to appear.

＿104ａA.MIYAJI, "Elliptic curves over Fp suitable for cryptosystems", Advanced in Cryptology-AU        SCRYPT'92, to appear.

＿105ａP. MONTGOMERY, "Speeding the Pollard and elliptic curve methods of factorization", Math          -ematics of Computation, 48 (1987), 243-264.

＿106ａP. MONTGOMERY, "A FFT Extension of the Elliptic Curve Method of Factorization", Ph.             D.thesis, UCLA, 1992.

＿107ａF. MORAIN AND J. OLIVOS, "Speeding up the computations on an elliptic curve using              addition-subtraction chains", Theoretical Informatics and Applications, 24 (1990), 531-543.

＿108ａF.MORAIN, "Building cyclic elliptic curves modulo large primes", Advances in Cryptology-EU

ROCRYPT'91, Lecture Notes in Computer Science, 547 (1991), Springer-Verlag, 328-336.

＿109ａC. MORENO, Algebraic Curves over Finite Fields, Cambridge University Press, 1991.

＿110ａR. MULLIN, I. ONYSZCHUK, S. VANSTONE AND R. WILSON, "Optimal normal bases in GF(pn)",        Discrete Applied Mathematics, 22 (1988/89), 149-161.

＿111ａNATIONAL BUREAU OF STANDARDS, "Data Encryption Standard", Federal Information               Processing Standard, U.S. Department of Commerce, FIPS PUB 46, Washington, DC, 1977.

＿112ａNATIONAL INSTITUTE FOR STANDARS AND TECHNOLOGY, "A proposed federal infromation           processing standard for digital signature strandard (DSS)", Technical Report FIPS PUB XX,         DRAFT, August 1991.

＿113ａNATIONAL INSTITUTE FOR STANDARDS AND TECHNOLOGY, "Announcement and specifications        for a secure hash standard (SHS)", Technical Report FIPS PUB YY, Draft, January 1992.

＿114ａJ. NECHVATAL, "Public key cryptography", in [144], 177-288.

＿115ａA. ODLYZKO, "Discrete logarithms and their cryptographic significance", Advances in               Cryptology-EUROCRYPT'84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag,       224-314.

＿116ａA. ODLYZKO, Personal communication, 1986.

＿117ａR. ODONI, V. VARADHARAJAN AND R. SANDERS, "Public key distribution in matrix rings",           Electronics Letters, 20 (1984), 386-387.

＿118ａT. OKAMOTO, A. FUJIOKA AND E. FUJISAKI, "An efficient digital signature scheme based on         an elliptic curve over the ring Zn", Advances in Cryptology-CRYPTO'92, to appear.

＿119ａJ. OMURA AND J. MASSEY, "Computational method and apparatus for finite field arithmetic",         U.S. patent number 4, 587, 627, May 1986.

＿120ａP. VAN OORSCHOT, "A comparison of practical public key cryptosystems based on integer           factorization and discrete logarithms", in [144], 289-322.

＿121ａJ. PILA, "Frobenius maps of abelian varieties and finding roots of unity in finite fields",             Mathematics of Computation, 55 (1990), 745-763.

＿122ａS. POHLIG AND M. HELLMAN, "An improved algorithm for computing logarithms over GF(p)        and its cryptographic significance", IEEE Transactions on Information Theory, 24 (1978),            106-110.

＿123ａJ. POLLARD, "MONTE Carlo methods for index computation mod p", Mathematics of Comput-

ation, 32 (1978),918-924.

＿124ａC. POMERANCE, "Fast, rigorous factorization and discrete logarithms algorithms", in Discrete        Algorithms and Complexity, 1987, 119-143.

＿125ａC. POMERANCE, "Very short primality proofs", Mathematics of Computation, 48 (1987), 315-

322.

＿126ａC. POMERANCE, "Factoring", Cryptology and Computational Number Theory, Proceedings of         Symposia in Applied Mathematics, 42 (1990), 24-47.

＿127ａR. RIVEST, "The MD4 message digest algorithm", Advances in Cryptology-CRYPTO'90,            Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 303-311.

＿128ａR. RIVEST, "RFC 1321: The MD5 message digest algorithm", Internet Activities Board, April        1992.

＿129ａR. RIVEST, A. SHAMIR AND L. ADLEMAN, "A method for obtaining digital signatures and            public-key cryptosystems", Communication of the ACM, 21 (1978), 120-126.

＿130ａT. ROSATI, "A high speed data encryption processor for public key cryptography",                  Proceedings of IEEE Custom Integrated Circuits Conference, San Diego, 1989, 12.3.1-12.3.5.

＿131ａJ. ROSSER AND L.SCHOENFIELD, "Approximate formulas for some functions of prime numbers",

,      Illinois J. of Mathematics, 6 (1962), 64-94.

＿132ａH. R□CK, "A note on elliptic curves over finite fields", Mathematics of Computation, 49            (1987), 301-304.

＿133ａH. R□CK, "Abelian surface and jacobian varieties over finite fields", Composito Mathematica,        76 (1990), 351-366.

＿134ａA. SALOMAA, Public-Key Cryptography, Springer-Verlag, Berlin, 1990.

＿135ａC. SCHNORR, "Efficient signature generation by smart cards", Journal of Cryptology, 4 (1991),        161-174.

＿136ａR. SCHOOF, "Elliptic curves over finite fields and the computation of square roots mod p",          Mathematics of Computation, 44 (1985), 483-494.

＿137ａR. SCHOOF, "Nonsingular plane cubic curves over finite fields", Journal of Combinatorial            Theory, A 46 (1987), 183-211.

＿138ａP. SCOTT, S. SIMMONS, S. TAVARES AND L. PEPPARD, "Architectures for exponentiaion in GF

(2m), IEEE Journal on Selected Areas in Communication, 6 (1988), 578-586.

＿139ａJ. SHALLIT, personal communication, 1991.

＿140ａJ. SILVERMAN, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.

＿141ａJ. SILVERMAN AND J. TATE, Rational Points on Elliptic Curves, Springer-Verlag, New York,        1992.

＿142ａR. SILVERMAN, "The multiple polynomial quadratic sieve", Mathematics of Computation, 48          (1987), 329-339.

＿143ａR. SILVERMAN AND S. WAGSTAFF, "A practical analysis of the elliptic curve factoring               algorithm", Mathematics of Computation, July 1993, to appear.

＿144ａG. SIMMONS (editor), Contemporary Cryptology: The Science of Information Integrity, IEEE        Press, New York, 1991.

＿145ａM.SMILD AND D BRANSTAD, "The Data Encryption Standard: past and future", in [144],         43-64.

＿146ａM. SMID AND D. BRANSTAD, "Response to comments on the NIST proposed Digital Signature        Standard", Advances in Cryptology-CRYPTO' 92, to appear.

＿147ａM. TSFASMAN AND S. VLADUT, Algebraic-Geometric Codes, Kluwer Academic Publishers,

＿148ａS. TSUJII AND T. ITOH, "An ID-based cryptosystem based on the discrete logarithm                problem", IEEE Journal on Selected Areas in Communitaions, 8 (1989), 467-473.

＿149ａS. VANSTONE AND R. ZUCCHERATO "Short RSA keys and their generation", preprint, 1993.

＿150ａJ. VOLOCH, "A note on elliptic curves over finite fields", Bull, Soc. Math. France, 116 (1988),        455-458.

＿151ａC. WANG AND D. PEI, "A VLSI design for computing exponentiations in GF(2m) and its             application to generate pseudorandom number sequences", IEEE Transactions on Computers,         39 (1990), 258-262.

＿152ａE. WATERHOUSE, "Abelian varieties over finite fields", Ann. Sci. □cole Norm. Sup., 2 (1969),        521-560.

＿153ａD. WELSH, Codes and Cryptography, Claredon Press, Oxford, 1988.

＿154ａR. ZUCCHERATO, personal communication, 1992.

＿155ａ"Debating Encryption Standards", Communications of the ACM, 35 (1992), 33-54.