참고문헌
- D.L.Dietmeyer, Logic Design of Digital Systems, Allyn and Bacon, 1979.
- K. Hwang, Comptuer Arithmetic principles, architecture, and design, John Wiley & Sons,1979
- M.D.Ercegovac and T.Lang, Digital Systems and Hardware Firmware Algorithms, Wiley, 1985.
- E.J.McClusky, Logic Design Principles, Prentice-Hall, 1986.
- D.Green, Modern Logic Design, Electronic Systems Engineer-ing Series, 1986.
- Chen; Wen-Ching Lin; Hao-Hsuan Wu,"A New Algorithm for High-Speed Modular Multiplication Design," IEEE Trans. On Circuit and Systems, VOLUME 56, issue 9, pp. 2009-2019. Sep., 2009. https://doi.org/10.1109/TCSI.2008.2011585
- Nibouche, O.; Boussakta, S.; Darnell, M.," Pipeline Architectures for Radix-2 New Mersenne Number Transform," IEEE Trans. On Circuit and Systems, VOLUME 56, issue 8, pp. 1668-1680, Aug., 2009. https://doi.org/10.1109/TCSI.2008.2008266
-
Meher, P.K.," Systolic and Super-Systolic Multipliers for Finite Field GF
$(2^{m})$ Based on Irreducible Trinomials, IEEE Trans. On Circuit and Systems, VOLUME 55, issue 4, pp. 1031-1040, Apr. 2008. https://doi.org/10.1109/TCSI.2008.916622 -
Tung-Chou Chen; Shyue-Win Wei; Hung-Jen Tsai," Arithmetic Unit for Finite Field
$GF(2^{m})$ , IEEE Trans. On Circuit and Systems, VOLUME 55, issue 3, pp. 828-837, Mar., 2008. -
Conway, T.," Galois field arithmetic over
$GF(p^{m})$ for highspeed/ low-power error-control applications," IEEE Trans. On Circuit and Systems, VOLUME 51, issue 4, pp. 709- 717, Apr., 2004. https://doi.org/10.1109/TCSI.2004.823659 -
G.Drolet,"A new representation of elements of finite fields
$GF(2^{m})$ yields small complexity arithmetic circuits,' IEEE Trans. Comput.,vol.47.no.9,pp.938-946,Sep.1998. https://doi.org/10.1109/12.713313 - R.J.McEliece, Finite Fields for Computer Science and Engineers, Kluer Academic Publishers, 1987.