DocumentCode
3182557
Title
A low-area, high-speed, processor array architecture for field ALU over GF (2m)
Author
Fayed, M. ; El-Kharashi, M. Watheq ; Gebali, F.
Author_Institution
Univ. of Victoria, Victoria
fYear
2007
fDate
16-18 Dec. 2007
Firstpage
297
Lastpage
305
Abstract
We propose a novel, low-area, high-speed architecture for the basic operations over GF(2m). The proposed architecture is a processor array based, which utilizes the most significant bit multiplication algorithm and polynomial basis. A design space exploration to optimize the area and speed of the proposed architecture was done. We use the National Institute of Standard and Technology recommended polynomials, which makes our design secure and more suitable for cryptographic applications. The proposed architecture is implemented for misin {163,283,571} on a Xilinx XC2V4000 device to verify its functionality and measure its performance. We achieve a frequency of 264 MHz, which allows the architecture to calculate GF(2163) multiplication in 640 ns and inversion in 14.357 mus.
Keywords
Galois fields; cryptography; digital arithmetic; logic design; microprocessor chips; polynomials; ALU; arithmetic logic units; bit multiplication algorithm; cryptographic applications; design space exploration; polynomial basis; processor array architecture; Arithmetic; Clocks; Computer architecture; Delay; Elliptic curve cryptography; Galois fields; Hardware; Inverters; Polynomials; Space exploration; Elliptic Curve Cryptography (ECC); Finite or Galois Field GF(2m); GF(2m) Arithmetic; GF(2m) Inversion; GF(2m) Multiplication; GF(2m) Squaring; Processor Array;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communications Technology, 2007. ICICT 2007. ITI 5th International Conference on
Conference_Location
Cairo
Print_ISBN
978-1-4244-1430-7
Type
conf
DOI
10.1109/ITICT.2007.4475666
Filename
4475666
Link To Document