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

ISSN： 0020-7160

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial Basis Multiplication over GF(2 m )

By Erdem Serdar

Acta Applicandae Mathematicae, Vol. 93, Iss. 1-3, 2006-09 ,pp. : 33-55

Springer Publishing Company

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

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

A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Vol. 102, Iss. 12, 2015-06 ,pp. : 1784-1814

John Wiley & Sons Inc

Access to resources Recommend Favorite

A novel image encryption algorithm based on chaotic maps and GF(2 8 ) exponent transformation

By Hussain Iqtadar

Nonlinear Dynamics, Vol. 72, Iss. 1-2, 2013-04 ,pp. : 399-406

Springer Publishing Company

Access to resources Recommend Favorite