TY - GEN
T1 - Versatile processor for GF(pm) arithmetic for use in cryptographic applications
AU - Byrne, A.
AU - Marnane, W. P.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/34547367511
U2 - 10.1109/NORCHP.2006.329227
DO - 10.1109/NORCHP.2006.329227
M3 - Conference proceeding
AN - SCOPUS:34547367511
SN - 1424407729
SN - 9781424407729
T3 - 24th Norchip Conference, 2006
SP - 281
EP - 284
BT - 24th Norchip Conference, 2006
PB - IEEE Computer Society
T2 - 24th Norchip Conference, 2006
Y2 - 20 November 2006 through 21 November 2006
ER -