참고문헌
- C. C. Wang and D. Pei, "A VLSI design for computing exponentiations in and its application to generate pseudorandom number sequences", IEEE Trans. Comput. vol. 39, pp. 258-262, 1990. https://doi.org/10.1109/12.45211
-
M. A. G. Martinez, G. M. Luna, F. R. Henriquez, "Hardware implementation of the binary method for exponentiation in GF(
$2^m$ )", Proc. Fourth International Conferenceon Computer Science, pp. 131-134, 2003. - K. Slind, "A verification of AES", http://www.cs.utah.edu.~slindpapersaes.html, 2003.
-
M. Kovac, N. Rangnathan, "ACE: A VLSI chip for Galois field GF(
$2^m$ )", IEEE T. Circuits and Systems, vol. 43, pp. 289-297, 1996. https://doi.org/10.1109/82.488283 - 한영모, "GF(2^m) 상에서의 효율적인 지수제곱 연산을 위한 VLSI Architecture 설계", 전자공학회논문지 제 41권 SC편 제 6호, pp. 27-35, 11월 2004년.
- B. Sunar, C. K. Koc, "An efficient optimal normal basis type II multiplier", IEEE T.Computers, vol. 50, pp. 83-87, 2001. https://doi.org/10.1109/12.902754
- C. K. Koc, B. Sunar, "Low complexity bit-parallel canonical and normal basis multipliers for a class of finite fields", IEEE T. Computers, vol. 47, pp. 353-356, 1998. https://doi.org/10.1109/12.660172
- F. R. Henriquez, C. K. Koc, "Parallel multipliers based on special irreducible pentanomials", IEEE T. Computers 52 (2003) 1-8.
- H. Fan, M. A. Hasan, "A new approach to sub-quadratic space complexity parallel multipliers for extended binary fields", IEEE T.Computers, vol. 56, pp. 224-233, 2007. https://doi.org/10.1109/TC.2007.19
-
S. T. J. Fenn, M. Benaissa, D. Taylor, "GF(
$2^m$ ) multiplication and division over the dual basis",IEEE T. Computers, vol. 45, pp. 319-327, 1996. https://doi.org/10.1109/12.485570