상세정보
학술대회
Hyperelliptic Curve Coprocessors on a FPGA
- 발행일
- 200408
- 출처
- International Workshop on Information Security Applications (WISA) 2004 (LNCS 3325), v.3325, pp.360-374
- 협약과제
- 04SK1100, 차세대 시큐리티 기술 개발(나노 기술을 이용한 차세대 암호시스템 기술개발, 수학기반 암호기술 및 안전성, 조현숙
- 초록
- Cryptographic algorithms are used in a large variety of different applications to ensure security services. It is, thus, very interesting to investigate various implementation platforms. Hyperelliptic curve schemes are cryptographic primitives to which a lot of attention was recently given due to the short operand size compared to other algorithms. They are specifically interesting for special-purpose hardware. This paper provides a comprehensive investigation of high-efficient HEC architectures. We propose a genus-2 hyperelliptic curve cryptographic coprocessor using affine coordinates. We implemented a special class of hyperelliptic curves, namely using the parameter h(x) = x and f = x5 + f1x + f0 and the base field GF(289). In addition, we only consider the most frequent case in our implementation and assume that the other cases are handled, e.g. by the protocol. We provide three different implementations ranging from high speed to moderate area. Hence, we provide a solution for a variety of applications. Our high performance HECC coprocessor is 78.5% faster than the best previous implementation and our low area implementation utilizes only 22.7% of the area that the smallest published design uses. Taking into account both area and latency, our coprocessor is an order of magnitude more efficient than previous implementations. We hope that the work at hand provides a step towards introducing HEC systems in practical applications. © Springer-Verlag Berlin Heidelberg 2004.
- KSP 제안 키워드
- Cryptographic Algorithms, Cryptographic primitives, High Speed, High performance, High-efficient, Hyperelliptic curve, Hyperelliptic curves, Most frequent, low-area, practical application, security service