DocumentCode
2645085
Title
Finite Field Multiplication Using Reordered Normal Basis Multiplier
Author
Gebali, Fayez ; Al-Somani, Turki
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
fYear
2011
fDate
26-28 Oct. 2011
Firstpage
320
Lastpage
326
Abstract
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.
Keywords
public key cryptography; ad-hoc technique; affine linear technique; affine nonlinear technique; elliptic curve cryptosystem; finite field modular multiplication; power consumption; processor array performance; reordered normal basis multiplier; space exploration design; Arrays; Delay; Finite element methods; Process control; Processor scheduling; Vectors; Affine linear scheduling and projection; Concurrency; Finite field; Nonlinear scheduling and projection; Optimal normal basis; Parallel algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Broadband and Wireless Computing, Communication and Applications (BWCCA), 2011 International Conference on
Conference_Location
Barcelona
Print_ISBN
978-1-4577-1455-9
Type
conf
DOI
10.1109/BWCCA.2011.51
Filename
6103052
Link To Document