Finite Field Multiplication Using Reordered Normal Basis Multiplier

We present in this paper affine linear and nonlinear techniques for design space exploration of the finite-field multiplication using reordered normal basis. Fifteen basic designs are possible using these linear techniques that are in close agreement with the results previously published using ad-ho...

Full description

Saved in:
Bibliographic Details
Main Authors: Gebali, F., Al-Somani, T.
Format: Conference Proceeding
Language:English
Subjects:
Affine linear scheduling and projection
Arrays
Concurrency
Delay
Finite element methods
Finite field
Nonlinear scheduling and projection
Optimal normal basis
Parallel algorithms
Process control
Processor scheduling
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present in this paper affine linear and nonlinear techniques for design space exploration of the finite-field multiplication using reordered normal basis. Fifteen basic designs are possible using these linear techniques that are in close agreement with the results previously published using ad-hoc techniques. However, the major contribution of this paper is the introduction of nonlinear techniques to allow the designer to control the workload per processor and also control the communication requirements between processors. We present also models for the performance of processor arrays implementing the finite field multiplier. Performance includes system area, delay and power consumption. The main parameters affecting performance include the number of bits processed in parallel per processor and the hardware details such as how much each performance parameters depend on the number of bits being processed in parallel.
DOI:10.1109/BWCCA.2011.51