DocumentCode :
1048880
Title :
Design of flexible GF(2/sup m/) elliptic curve cryptography processors
Author :
Benaissa, Mohammed ; Ming Lim, Wei
Author_Institution :
Dept. of Electron. & Electr. Eng., Univ. of Sheffield
Volume :
14
Issue :
6
fYear :
2006
fDate :
6/1/2006 12:00:00 AM
Firstpage :
659
Lastpage :
662
Abstract :
The design of flexible elliptic curve cryptography processors (ECP) is considered in this paper. Novel word-level algorithms and implementations for the underlying GF(2m) multiplication and squaring arithmetic which enable improved flexibility versus performance tradeoffs, are presented and employed in the design of an efficient flexible ECP architecture; corresponding field-programmable gate-array (FPGA) prototyping results for two different processor word lengths are also included for evaluation
Keywords :
cryptography; field programmable gate arrays; logic design; microprocessor chips; Galois field; design; elliptic curve cryptography processors; field-programmable gate arrays; squaring arithmetic; underlying GF(2m) multiplication; Algorithm design and analysis; Application specific processors; Arithmetic; Elliptic curve cryptography; Field programmable gate arrays; Hardware; Performance loss; Polynomials; Prototypes; Very large scale integration; Elliptic curve cryptography (ECC); field-programmable gate array (FPGA);
fLanguage :
English
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-8210
Type :
jour
DOI :
10.1109/TVLSI.2006.878235
Filename :
1661609
Link To Document :
بازگشت