DocumentCode :
1917009
Title :
Versatile Processor for GF(pm) Arithmetic for use in Cryptographic Applications
Author :
Byrne, A. ; Marnane, W.P.
Author_Institution :
Dept. of Electr. & Electron. Eng., Cork Univ. Coll.
fYear :
2006
fDate :
Nov. 2006
Firstpage :
281
Lastpage :
284
Abstract :
There has been a lot of research in recent years into cryptographic applications over GF(2m), GF(pm), p ¿ 2 and GF(p), p large prime. In this paper a general architecture for a cryptographic processor capable of handling operations over any field, and the software developed to generate it, will be introduced. The processor presented implements a ROM instruction set to simplify control of the system and reduce hardware complexity. The post place and route results for a number of generated elliptic curve processors will be presented.
Keywords :
coprocessors; cryptography; GF(pm) arithmetic; ROM instruction; cryptographic applications; cryptographic processor; elliptic curve processors; Arithmetic; Elliptic curve cryptography; Elliptic curves; Galois fields; Hardware; Identity-based encryption; Polynomials; Public key; Public key cryptography; Security;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Norchip Conference, 2006. 24th
Conference_Location :
Linkoping, Sweden
Print_ISBN :
1-4244-0772-9
Type :
conf
DOI :
10.1109/NORCHP.2006.329227
Filename :
4126999
Link To Document :
بازگشت