Browse > Article

Scalable multiplier and inversion unit on normal basis for ECC operation  

이찬호 (숭실대학교 정보통신전자공학부)
이종호 (숭실대학교 정보통신전자공학부)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.40, no.12, 2003 , pp. 80-86 More about this Journal
Abstract
Elliptic curve cryptosystem(ECC) offers the highest security per bit among the known publick key system. The benefit of smaller key size makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper, we propose a new multiplier structure with configurable output sizes and operation cycles. The number of output bits can be freely chosen in the new architecture with the performance-area trade-off depending on the application. Using the architecture, a 193-bit normal basis multiplier and inversion unit are designed in GF(2$^{m}$ ). It is implemented using HDL and 0.35${\mu}{\textrm}{m}$ CMOS technology and the operation is verified by simulation.
Keywords
ECC; multiplier; inversion unit; finite field operation; normal basis;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 K.H. Leung, K. W. Ma, W.K. Wong, P.H.W. Leong, FPGA implementation of a microcoded elliptic curve cryptographic processor, Field Programmable Custom Computing Machines, 2000 IEEE Symposium on , 2000, pp. 68-76   DOI
2 S. Sutikno, R. Effendi, A Surya, Design and Implementation of Arithmetic Processor For $F_2$ for Elliptic Curve Cryptosystems, IEEE APCCAS 1998, pp. 647-650   DOI
3 J.L. Massey and J.K. Omura, Computational method and apparatus for finite field architecture, U.S. PAtent Application, submitted 1981
4 G.L. Feng, A VLSI Architecture for Fast Inversion in GF$(2^m)$), IEEE Trans. Computer, vol. 38, no. 10, pp. 1383-1386, Oct, 1989   DOI   ScienceOn
5 SEC1, Elliptic Curve Cryptography, v.1.0, pp. 62, Sep.20, 2000
6 TTAS.KO-12.0015, 부가형 전자서명 방식 표준-제3부: 타원곡선을 이용한 인증서 기반 전자서명 알고리즘, pp. 8-10, pp. 61-70
7 IEEE std 1363-2000, IEEE standard specifica-tions for public-key cryptography, pp. 110
8 C.C. Wang, T.K. Trung, H.M. Shao, L.J. Deutsch, J.K. Omura, I.S. Reed, VLSI architectures for computing multiplications and inverses in GF$(2^m)$, IEEE Trans. Compt., vol. C-34, pp. 709-717, Aug. 1985   DOI   ScienceOn
9 Y.R. Shayan, T. Le-Ngoc, The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs, Circuits, Devices and Systems, IEE Proceedings G , vol. 136, issue 6, pp. 345-349, Dec. 1989   DOI   ScienceOn