Abstract
This paper is concerned with efficient hardware architectures for normal basis multipliers in GF(2n). New serial input/parallel output architectures are derived. The complexity of these multipliers is equivalent to the complexity of the Massey-Omura multiplier. We also combine dual basis and normal basis techniques. The duality of normal bases is shown to be equivalent to the symmetry of the logic array of the serial input/parallel output architectures proposed in this paper.
Preview
Unable to display preview. Download preview PDF.
Literature
Th.Beth, On the Arithmetics of Galoisfields and the Like, in Proc. of AAECC3, Springer LNCS 229, 1986
Th. Beth, W. Fumy, R. Mühlfeld, Zur algebraischen Diskreten Fourier-Transformation, Archiv der Mathematik, Vol.40, pp.238–244, 1983
W.Fumy, Über orthogonale Transformationen und fehlerkorrigierende Codes, Dissertation, Universität Erlangen, 1986
R.Lidl, H.Niederreiter, Finite Fields, Cambridge University Press, 1984
J.L.Massey, J.K.Omura, Computational method and apparatus for finite field arithmetic, U.S.Patent application, submitted 1981
R.McEliece, Finite Fields for Copmputer Scientits and Engineers, Kluwer, 1987
C.C. Wang, et al., VLSI Architectures for Computing Multiplications and Inverses in GF(2m), IEEE Trans. on Computers, Vol. C-34, No.8, pp.709–717, 1985
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiselmann, W., Gollmann, D. (1989). Symmetry and duality in normal basis multiplication. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_62
Download citation
DOI: https://doi.org/10.1007/3-540-51083-4_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51083-3
Online ISBN: 978-3-540-46152-4
eBook Packages: Springer Book Archive