PARTITION ALGORITHM FOR PARALLEL PROCESSING OF ARRAY MULTIPLICATION IN GF(2m) FIELDS

By WUN CHIOU C.  

International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. : 805-809

Taylor & Francis Ltd

Access to resources Recommend Favorite

Bit-Parallel Arithmetic Implementations over Finite Fields GF(2 m ) with Reconfigurable Hardware

By Imaña J.L.  

Acta Applicandae Mathematicae, Vol. 73, Iss. 3, 2002-09 ,pp. : 337-356

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial multiplication over finite fields: from quadratic to straight-line complexity

By Bshouty Nader   Kaminski Michael  

computational complexity, Vol. 15, Iss. 3, 2006-10 ,pp. : 252-262

Springer Publishing Company

Access to resources Recommend Favorite

On the Complexity of Parallel Algorithms for Computing Inverses in GF (2 m ) with m Prime

By Leone M.  

Acta Applicandae Mathematicae, Vol. 93, Iss. 1-3, 2006-09 ,pp. : 149-160

Springer Publishing Company

Access to resources Recommend Favorite

Recurrent Methods for Constructing Irreducible Polynomials over GF(2 s )

By Kyuregyan M.K.  

Finite Fields and Their Applications, Vol. 8, Iss. 1, 2002-01 ,pp. : 52-68

Elsevier

Access to resources Recommend Favorite