FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3^m)

This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of which is a modular multiplication unit implemented using the systolic Montgomery multiplication algorithm. Another novelty of our proposed architecture is that it implements the field GF(3m ), which provides significant performance gains.

• Type: Conference
• Year: 2008
• Where: RECONFIG
• Authors: Ilker Yavuz, Siddika Berna Ors Yalcin, Çetin Kaya Koç
• Keywords: Efficient Arithmetic Processor, Modular Multiplication Unit, RECONFIG 2008, Reconfigurable Computing, Systolic Montgomery Multiplication