Composite Field Multiplier based on Look-Up Table for Elliptic Curve Cryptography Implementation  

Oleh:

Paryasto, Marisa W. ; Rahardjo, Budi ; Yuliawan, Fajar ; Muchtadi-Alamsyah, Intan ; Kuspriyanto

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI
Dalam koleksi: Journal of ICT Research and Applications vol. 6C no. 1 (2012), page 63-81.
Topik: Composite Field; Cryptography; Elliptic Curve; Finite Field; Multiplier; Security
Fulltext: 1_Thom.pdf (1.03MB)

Isi artikel

Implementing a secure cryptosystem requires operations involving hundreds of bits. One of the most recommended algorithm is Elliptic Curve Cryptography (ECC). The complexity of elliptic curve algorithms and parameters with hundreds of bits requires specific design and implementation strategy. The design architecture must be customized according to security requirement, available resources and parameter choices. In this work we propose the use of composite field to implement finite field multiplication for ECC implementation. We use 299-bit keylength represented in GF((213)23) instead of in GF(2299). Composite field multiplier can be implemented using different multiplier for ground-field and for extension field. In this paper, LUT is used for multiplication in the ground-field and classic multiplieris used for the extension field multiplication. A generic architecture for the multiplier is presented. Implementation is done with VHDL with the target device Altera DE2. The work in this paper uses the simplest algorithm to confirm the idea that by dividing field into composite, use different multiplier for base and extension field would give better trade-off for time and area. This work will be the beginning of our more advanced further research that implements composite-field using Mastrovito Hybrid, KOA and LUT.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali