參考文獻 |
[1]A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers,Boston, MA,1993.
[2]N.Koblitz. A Course in Number Theory and Cryptography. Springer, Berlin, Germany, Second edition, 1994.
[3]I. Blake, G.Seroussi, and N. Smart. Elliptic Curve in Cryptography. Cambridge University Press, New York, NY, 1999.
[4]A.K. Lenstra and E. R. Verheul. Selecting cryptographic key sizes. In The 3rd Workshop on Elliptic Curve Cryptography (ECC 99), Waterloo, Canada, November 1-3 1999.
[5]S.C. Pohlig and M.E. Hellamn. An Improved Algorithm for Computing Logarithms if GF(p) and Its Cryptographic Significance. IEEE Transactions on Information Theory, v.24,n. 1, pp.106-111, Jan 1978.
[6]R.L. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communication of the ACM, v.21,n.2, pp.120-126, Feb 1978.
[7]R.L. Rivest, A. Shamir, and L.M. Adleman. On Digital Signatures and Public Key Cryptosystems. MIT Laboratory for Computer Science, Technical Report, MIT/LCS/TR-212, Jan 1979.
[8]Bruce Schneier. Applied Cryptography; Protocols, Algorithms and Source code in C. John Wiley & Sons, Inc., 1994.
[9]C.C.Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura, and I.S. Reed. VLSI Architecture for Computing Multiplications and Inverses in GF(2m). IEEE Tran. Comput., vol. C-34, pp. 709-717, Aug. 1985.
[10]M.A. Hasan, M.Z. Wang, and V.K. Bhargava. A Modified Massey-Omura Parallel Multiplier for a Class of Finite fields. IEEE Trans. Computers, vol. 42, no. 10, pp. 1,278-1,280, Oct. 1993.
[11]S. Oh, C.H. Kim, J.Lim, D.H. Cheon. Efficient Normal Basis Multipliers in Composite Fields. IEEE Trans. Computers, vol.49, no. 10, pp. 1133-1138,Oct. 2000.
[12]E.R. Berlekamp. Algebraic Coding Theory. Mc-Graw Hill Book Company, 1968.
[13]R.Lidl and H. Niederreiter. Introduction to Finite Fields and Their Applications. New York NY: Cambridge Univerisity Press 1994.
[14]R.J. McEliece. Finite fields for Computer Scientists and Engineers. Boston MA: Kluwer Academic Publishers 1987.
[15]A.J. Menezes. Applications of Finite Fields. Boston MA: Kluwer Academic Publisher 1993.
[16]R.Lidl and H. Niederreiter. Finite Fields, in Encyclopedia of Mathematics and its Applications. G.-C. Rota, editor, Addison-Wesley, 1983.
[17]J. Omura and J. Massey. Computational method and apparatus for finite field arithmetic. U.S. Patent number 4587627, May 1986.
[18]R.Mullin, I. Onyszchuk, U.A. vanstone and R. Wilson. Optimal normal bases in GF(pn). Discrete Appl. Math., 22, 149-161, 1988/89.
[19]S.Gao, H.W. Lenstra. Optimal normal bases. Designs, Codes and Cryptography, 2, 315-323, 1992.
[20]G. Agnew, R. Mullin, I. Onyszchuk, S. Vanstone. An implementation for a fast public-key cryptosystem. Journal of Cryptology, 3(1991), 63-79.
[21]P.K.S. Wah and M.Z. Wang. Realization and application of the Massey-Omura lock. Presented at the Int. Zurich Sem., 1984.
[22]M.A. Hasan, M.Z. Wang, V.K. Bhargava. Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m). IEEE Trans. Comput., vol. 41, pp. 962-971, Aug. 1992.
[23]T. Itoh and S. tsujii. Structure of parallel multipliers for a class of fields GF(2m). Inform. Comp., vol. 83, pp. 21-40, 1989.
[24]T.Itoh., Teechai and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2t) using normal bases. J. Society for Electronic Communication 44:31-36, 1986.
[25]J. Silverman. The arithmetic of elliptic curves. Springer-Verlag, New-York, 1986.
[26]A. Menezes, T. Okamoto and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field., IEEE Transactions on Information Theory, 39(1993), 1639-1646.
[27]D.E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 2nd edition.
[28]A. Menezes, M. Qu, and S. Vanstone. Elliptic Curve systems. Proposed IEEE P1363 Standard, pages 1-42, April 1995.
[29]J.H. Silverman and J. Tate. Rational Points on Elliptic Curves. Springer-Verlag, 1992.
[30]C. Paar, P. Fleischmann, and P. Poelse. Efficient Mulitplier Architecture for Galois Fields. IEEE Trans Computers, vol. 47, no. 2, pp.162-170, Feb. 1998.
[31]AMERICAN NATIONAL STANDARD X9.62-1998. public key cryptography for the financial services industry. The Elliptic Curve Digital Signature Alogorithm (ECDSA).
[32]B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal basis Multipliers for a Class of Finite Fields. IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
[33]M.A. Hasan, M.Z. Wang, and V.K. Bhargava. Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fileds GF(2^m). IEEE Trans Comput., vol. 41, no.8,pp. 962-971, Aug. 1992. |