References
- W. W. Peterson and E. J. Weldom, Error-Correcting Codes. Cambridge, MA: MIT Press, 1972
- D. E. R. Denning, Cryptography and Data security. Reading MA: Addison-Wesley, 1983
- I. S. Reed and T. K. Truong, 'The use of finite fields to compute convolutions,' IEEE Trans. Inform Theory, vol. IT-21, pp.208~213, Mar. 1975 https://doi.org/10.1109/TIT.1975.1055352
- D. E. Knuth, The art of computer programming, Vol. 2: seminumerical algorithms. Addison-Wesley, Reading, Mass., 2nd edition, 1981
-
C. L. Wang, and J. L. Lin, 'Systolic array implementation of multipliers for finite field
$GF(2^m)$ ,' IEEE Trans. Circuits System, vol. 38, pp. 796-800, July, 1991 https://doi.org/10.1109/31.135751 -
J. H. Guo and C. L. Wang, 'Digit-serial systolic multiplier for finite fields
$GF(2^m)$ ,' IEE Proc. Compu, Digit. Tech, vol. 145, pp.l43~148, 1998 https://doi.org/10.1049/ip-cdt:19981906 - E. D. Mastrovito, 'VLSI architecture for computations in Galois fields,' Ph. D. dissertation, Dept. Elec. Eng., Linkoping Univ., Linkoping, Sweeden, 1991
- C. K. Koc and B. Sunar, 'Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields,' IEEE Trans. Computer, vol. C-47, pp.353-356, Mar. 1998
-
S. W. Wei, 'A systolic power-sum for
$GF(2^m)$ ,' IEEE Trans. Computer, vol. 43, pp.226~229, Feb. 1994 https://doi.org/10.1109/12.262128 -
C. L. Wang and J. L. Lin, 'A systolic architecture for inverses and divisions in
$GF(2^m)$ ,' IEEE Trans. Computer, vol. 42, pp.1141-1146, Sep. 1993 https://doi.org/10.1109/12.241603 -
S. T. J. Fenn, M. G. Parker, M. Benaissa, and D. Taylor, '
$GF(2^m)$ multiplication and division over the dual basis,' IEEE Trans. Computer, vol. 45, pp.319-327, Mar. 1996 https://doi.org/10.1109/12.485570 -
J. H. Guo and C. L. Wang, 'Bit-serial Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in
$GF(2^m)$ ', Proc. 1997 Int. Symp. VLSI Technology, Systems, and Applications, pp.113-117, 1997 -
C. L. Wang and J. H. Guo, 'New Systolic Array for C +
$AB^2 , Inversion and Division in$GF(2^m)$ ,' IEEE Trans. Computer, vol. 49, pp.H20~1125, Oct., 2000 https://doi.org/10.1109/12.888047 -
T. Itoh, and S. Tsujii, 'Structure of parallel multipliers for a class of fields
$GF(2^m)$ ,' Info. Trans., pp.21-40, 1989 https://doi.org/10.1016/0890-5401(89)90045-X - M. A. Hasan, M. Z. Wang, and V. K. Bhargava, 'A modified Massey-Omura parallel multipliers for a class of finite fields,' IEEE Trans. Computer, C-42, pp.1278-1280, 1993 https://doi.org/10.1109/12.257715
-
S. T. J. Fenn, M. G. Parker, M. Benaissa, and D. Taylor, 'Bit-serial multiplication in
$GF(2^m)$ using irreducible all-one polynomials,' IEE Proc. Compu., Digit. Tech, vol. 144, pp.391-393, 1997 https://doi.org/10.1049/ip-cdt:19971586