An Architecture for Computing Zech's Logarithms in GF(2m)

Authors:
Francisco M. Assis;C. E. Pedreira
Affiliations:
Univ. Federal da Paraíba, Campina Grande, Brazil;Pontifícia Carólica do Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
IEEE Transactions on Computers
Year:
2000

Citing 4
Cited 2

Depth-Size Tradeoffs for Neural Computation

IEEE Transactions on Computers - Special issue on artificial neural networks
Discrete neural computation: a theoretical foundation

Discrete neural computation: a theoretical foundation
GF(2m) Multiplication and Division Over the Dual Basis

IEEE Transactions on Computers
A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields

IEEE Transactions on Computers

Primitive Polynomials over GF(2) - A Cryptologic Approach

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Multiples of Primitive Polynomials over GF(2)

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper, a new method for calculation of Zech's logarithm in $GF(2^m)$ is presented. For a given element, the logarithm is calculated by bit operations performed on its binary representation. No look-up tables are used. The proposed method makes feasible the implementation of an universal-type device for finite field arithmetic.