HW/SW co-design of a hyperelliptic curve cryptosystem using a microcode instruction set coprocessor

被引:4
作者
Hodjat, Alireza
Batina, Lejla
Hwang, David [1 ]
Verbauwhede, Ingrid
机构
[1] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90024 USA
[2] Katholieke Univ Leuven, ESAT, SCD, COSIC, B-3000 Louvain, Belgium
基金
美国国家科学基金会;
关键词
hardware/software co-design; hyperelliptic curve cryptography; Galois Field GF(2(m)); genus; 2; curves; microcode coprocessor;
D O I
10.1016/j.vlsi.2005.12.011
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Hardware/software co-design of computationally intensive cryptosystems is the preferred solution to achieve the required speed for resource-limited embedded applications. This paper presents a microcode instruction set coprocessor which is designed to work with 8-bit microcontrollers to implement a hyperelliptic curve cryptosystem. The microcode coprocessor is capable of performing a range of Galois Field operations using a dual-multiplier/dual-adder datapath and storing the intermediate results in the external RAM unit of the coprocessor. This coprocessor is programmed using the software routines of the 8-bit microcontroller which implement the HECC divisor's doubling and addition operations. The Jacobian scalar multiplication was computed in a 656 ms (7.87 M cycles) on 8051 microcontroller running at 12 MHz clock frequency which is 228 times faster than the pure software implementation. This number is 78 ms (1 M cycles) on the Atmel AVR microcontoller runing at 12 MHz clock which is 106 times faster than the pure software implementation. Both HW/SW co-design implementations are comparable to existing HECC implementations on the 32-bit ARM7 at 80 MHz. (C) 2006 Published by Elsevier B.V.
引用
收藏
页码:45 / 51
页数:7
相关论文
共 15 条
[1]  
BAKTIR S, 2004, P 38 AS C SIGN SYST
[2]  
Boston N, 2002, LECT NOTES COMPUT SC, V2523, P400
[3]  
BYRAMJEE B, CLASSIFICATION GENUS
[4]  
CANTOR DG, 1987, MATH COMPUT, V48, P95, DOI 10.1090/S0025-5718-1987-0866101-0
[5]  
Gura N, 2004, LECT NOTES COMPUT SC, V3156, P119
[6]   EFFECTIVE RECURSIVE ALGORITHM FOR COMPUTING MULTIPLICATIVE INVERSES IN GF(2M) [J].
ITOH, T ;
TSUJII, S .
ELECTRONICS LETTERS, 1988, 24 (06) :334-335
[7]  
KIM H, 2004, WORKSH INF SEC APPL
[8]  
KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
[9]  
KOBLITZ N, 1988, LNCS, V403, P94, DOI DOI 10.1007/0-387-34799-2_8
[10]  
KUMAR S, 2004, LECT NOTES COMPUTER, V3203