참고문헌
- R. J. McEliece,Finite Fields for Computer Scientists and Engineers, New York: Kluwer-Academic, 1987
- W. Diffie and M. Hellman, 'New Directions in Cryptography,' IEEE Trans. on Info. Theory, vol. IT- 22(6) pp. 644-654, 1976
- A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Boston, MA: Kluwer Academic Publishers, 1993
-
S. T. Fenn, M. Benaissa, and D. Taylor, '
$GF(2^m )$ Multiplication and division over the dual base,' IEEE Trans. Computers, vol. 4, no. 3, pp. 319-327, Mar. 1996 https://doi.org/10.1109/12.485570 - I. S. Hsu, I. S. Reed, T. K. Truong, K. Wang, C. S. Yeh, and L. J. Deutsch, 'The VLSI implementation of a Reed-Solomon encoder using Berlekamp's bit-serial multiplier algorithm,' IEEE Trans. Computer, vol. C-33, pp. 906-911, Oct. 1984 https://doi.org/10.1109/TC.1984.1676351
- T. Itoh and S. Tsujii, 'Structure of parallel multipliers for Galois Fields GF(2k),' Information and Computers, vol. 83, pp. 21-40, 1989 https://doi.org/10.1016/0890-5401(89)90045-X
- C. K. Koc and T. Acar, 'Montgomery Multiplication in GF(2k),' Proceedings of Third Workshop on Selected Area in Cryptography, pp. 95-106, queen's University, Kinston, Ontario, Canada, August 15-16, 1996
-
E. D. Mastrovito, 'VLSI Design for multiplication over Finite Fields
$GF(2^m )$ ,' Lecture Notes in Computer Science 357, pp. 297-303, Berlin: Springer-Verlag, Mar. 1989 -
P. A. Scott, S.E. Travares, and L.E. Peppard, 'A fast VLSI multiplier for
$GF(2^m )$ ,' IEEE J. Selected Areas in Comm., vol. 4. pp.62-66, Jan., 1986 https://doi.org/10.1109/JSAC.1986.1146305 -
C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omura, and I. S. Reed, 'VLSI architectures for computing multiplications and inverses in
$GF(2^m )$ ,' IEEE Trans. Computer, vol. C-34, pp. 709-717, Aug., 1985 https://doi.org/10.1109/TC.1985.1676616 -
C. S. Yeh, I. S. Reed, and T. K. Truong, 'Systolic multipliers for finite fields
$GF(2^m )$ ,' IEEE Trans. Computer, vol. C-33, pp.357-360, Apr., 1984 https://doi.org/10.1109/TC.1984.1676441 -
C. L. Wang and J. L. Lin, 'Systolic Array Implementation of Multipliers ofr finite fields
$GF(2^m )$ ,' IEEE Trans. Circuits Systems, vol. 38, pp. 796-800, July 1991 https://doi.org/10.1109/31.135751 - I. S. Hsu. T. K. Truong, L.J. Deutsch, and I. S. Reed, 'A Comparison of VLSI architecture of finite field multipliers using dual, normal, standard bases,' IEEE Trans. Computer, vol. 37, pp. 735-739, June 1988 https://doi.org/10.1109/12.2212
-
S. K. Jain and K. K. Parhi, 'Low latency standard basis
$GF(2^m )$ multiplier and squarer architectures, Proc. IEEE ICASSP, pp. 2747-2750, 1995 https://doi.org/10.1109/ICASSP.1995.480130 - S. K. Jain, L. Song, and K. K. Parhi, 'Efficient Semisystolic Architectures for Finite-Field Arithmetic,' IEEE Trans. On VLSI Systems, VOL. 6, NO. 1, pp. 101-113, 1998 https://doi.org/10.1109/92.661252
- L. Song and K. K. Parhi, 'Effiecient finite field serial/parallel multiplication,' Proc. Int. Conf, Application Specific Syst., Architecture and Processors, Chicago, IL, pp. 72-82, 1996 https://doi.org/10.1109/ASAP.1996.542803
- S. Y. Kung, VLSI Array Processors, Prentice-Hall, 1987
- K. Y. Yoo, 'A Systolic Array Design Methodology for Sequential Loop Algorithms,' Ph.D. thesis, Rensselaer Polytechnic Institute, New York, 1992
- K. Hwang, Computer Arithmetic, John Wiley & Sons, 1979