Sciweavers

RECONFIG
2008
IEEE

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

14 years 5 months ago
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.
Ilker Yavuz, Siddika Berna Ors Yalcin, Çeti
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where RECONFIG
Authors Ilker Yavuz, Siddika Berna Ors Yalcin, Çetin Kaya Koç
Comments (0)