FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3^m)
İlker Yavuz, Berna Örs, Çetin Kaya Koç · 2008
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(3^m), which provides significant performance gains.