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

ISSN： 0167-8019

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

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

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 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

Critical Layers m Parallel Flows

STUDIES IN APPLIED MATHEMATICS, Vol. 51, Iss. 2, 1972-06 ,pp. : 139-161

John Wiley & Sons Inc

Access to resources Recommend Favorite

Critical Layers m Parallel Flows

STUDIES IN APPLIED MATHEMATICS, Vol. 51, Iss. 2, 1972-06 ,pp. : 139-161

John Wiley & Sons Inc

Access to resources Recommend Favorite