Title :
Double-basis multiplicative inversion over GF(2m)
Author :
Hasan, M. Anwarul
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fDate :
9/1/1998 12:00:00 AM
Abstract :
Inversion over Galois fields is much more difficult than the corresponding multiplication. Efficient computation of inverses in GF(2 m) is considered by solving a set of linear equations over the ground field GF(2). The proposed algorithm uses two separate bases for the representation of its input and output elements and has low computational complexity. The algorithm is also suitable for hardware implementation using VLSI technologies
Keywords :
Galois fields; VLSI; computational complexity; digital arithmetic; linear algebra; Galois fields; VLSI technologies; computational complexity; double basis multiplicative inversion; ground field; hardware implementation; linear equations; Arithmetic; Computational complexity; Digital signatures; Elliptic curve cryptography; Equations; Galois fields; Hardware; Polynomials; Protocols; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
