A Scalable Structure for a Multiplier and an Inversion Unit in GF(2m)

ETRI Journal

关键词: finite field;    inversion;    multiplier;    Elliptic curve cryptography;   

Others  :  1184735
DOI  :  10.4218/etrij.03.0303.0014

【 摘 要 】

Elliptic curve cryptography (ECC) offers the highest security per bit among the known public key cryptosystems. The operation of ECC is based on the arithmetic of the finite field. This paper presents the design of a 193-bit finite field multiplier and an inversion unit based on a normal basis representation in which the inversion and the square operation units are easy to implement. This scalable multiplier can be constructed in a variable structure depending on the performance area trade-off. We implement it using Verilog HDL and a 0.35 μm CMOS cell library and verify the operation by simulation.

   

【 参考文献 】

• [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
• [2]SEC1, Elliptic Curve Cryptography, v.1.0, pp. 62, Sep.20, 2000.
• [3]TTAS.KO-12.0015, Digital Signature Mechanism with Appendix ? Part 3: Korean Certificate-based Digital Signature Algorithm using Elliptic Curves, pp. 8-10, pp. 61-70
• [4]S. Sutikno, R. Effendi, A. Surya, Design and Implementation of Arithmetic Processor For F2155_for Elliptic Curve Cryptosystems, IEEE APCCAS 1998, pp. 647-650
• [5]T. Itoh, O. Teechai and S. Tsujii, A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases, Information and Computation 78, pp. 171-177, 1988.
• [6]G.L. Feng, A VLSI Architecture for Fast Inversion in GF(2m), IEEE Trans. Computer, vol. 38, no. 10, pp. 1383-1386, Oct. 1989.
• [7]J.L. Massey and J.K. Omura, Computational method and apparatus for finite field architecture, U.S. PAtent Application, submitted 1981.
• [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(2m), IEEE Trans. Compt., vol C-34, pp. 709-717, Aug. 1985.
• [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
• [10]IEEE std 1363-2000, IEEE standard specifications for public-key crypto- graphy, pp. 110.