GF(2m) multiplication and division over the dual basis

IEEE Transactions on Computers

Volumn 45, Issue 3, 1996, Pages 319-327

  Fenn, Sebastian T J ^a   Benaissa, Mohammed ^a   Taylor, David ^a  

^a UNIVERSITY OF HUDDERSFIELD   (United Kingdom)

Author keywords

Dual basis; Finite field division; Finite field multiplication; Irreducible polynomials; Reed Solomon codecs; Systolic arrays; VLSI

Indexed keywords

EID: 0000142152     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.485570     Document Type: Article

References (26)

1. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
2. R.L. Rivest, A. Shamir, and L.A. Adleman, "A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
3. E.R. Berlekamp, "Bit-Serial Reed-Solomon Encoders," IEEE Trans. Information Theory, vol. 28, pp. 869-874, Nov. 1982.
4. m)," IEE Proc. E., vol. 139, pp. 230-236, May 1992.
5. m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 972-980, Aug. 1992.
6. E.D. Mastrovito, "VLSI Design for Multiplication over Finite Fields," LNCS-357, Proc. AAECC-6, pp. 297-309, Rome, July 1988, Springer-Verlag.
7. E.D. Mastrovito, "VLSI Architectures for Computations in Galois Fields," PhD thesis, Linkoping Univ., Linkoping, Sweden, 1991.
8. I.S. Hsu, T.K. Truong, L.J. Deutsch, and I.S. Reed, "A Comparison of VLSI Architectures of Finite Field Multipliers Using Dual, Normal or Standard Bases," IEEE Trans. Computers, vol. 37, no. 6, pp. 735-737, June 1988.
9. J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," U.S. Patent Application, Submitted 1981.
10. M. Morii, M. Kasahara, and D.L. Whiting, "Efficient Bit-Serial Multiplication and the Discrete-Time Wiener-Hopft Equation over Finite Fields," IEEE Trans. Information Theory, vol. 35, pp. 1,177-1,183, Nov. 1989.
11. m)," IEEE J. Selected Areas of Comm., vol. 4, pp. 62-66, Jan. 1986.
12. M. Wang and I.F.Blake, "Bit-Serial Multiplication in Finite Fields," SIAM J. Discrete Maths., vol. 3, pp. 140-148, Feb. 1990.
13. n)," Discrete Applied Maths., pp. 142-169, 1988/89.
14. m) Based Multiplication and Division Algorithm," IEEE Trans. VLSI Systems, vol. 1, pp. 22-30, Mar. 1993.
15. 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. Computers, vol. 33, no. 10, pp. 906-911, Oct. 1984.
16. R.E. Blahut, Theory and Practice of Error Control Codes. Reading, Mass.: Addison-Wesley, 1983.
17. E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
18. K. Araki, I. Fujita, and M. Morisue, "Fast Inverter over Finite Field Based on Euclid's Algorithm," Trans. IEICE E-72, pp. 1,230-1,234, 1989.
19. m)," IEEE Trans. Computers, vol. 38, no. 10, pp. 1,383-1,386, Oct. 1989.
20. m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985.
21. R. Lidl and H. Niederreiter, An Introduction to Finite Fields and Their Applications. Cambridge: Cambridge Univ. Press, 1986.
22. S.T.J. Fenn, "Optimised Algorithms and Circuit Architectures for Performing Finite Field Arithmetic in Reed-Solomon Codecs," PhD thesis, Univ. of Huddersfield, 1993.
23. m)," Electonic Letters, vol. 28, pp. 2,259-2,261, Nov. 19, 1992.
24. G.K. Maki and P.A. Owlsey, "Parallel Berlekamp vs. Conventional VLSI Architecture," Gov. Microcircuit Applics. Conf. Rec., pp. 5-7, Nov. 1986.
25. B. Hochet, P. Quinton, and Y. Robert, "Systolic Gaussian Elimination over GF(p) with Partial Pivoting," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,321-1,324, Sept. 1989.
26. m)," Electronic Letters, vol. 29, pp. 469-470, Mar. 4,1993.