The Community for Technology Leaders
Reconfigurable Computing and FPGAs, International Conference on (2008)
Dec. 3, 2008 to Dec. 5, 2008
ISBN: 978-0-7695-3474-9
pp: 397-402
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.
Elliptic curve cryptography, Galois field of characteristic 3, FPGA, Montgomery, systolic array
Çetin Kaya Koç, Siddika Berna Örs Yalçin, Ilker Yavuz, "FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3^m)", Reconfigurable Computing and FPGAs, International Conference on, vol. 00, no. , pp. 397-402, 2008, doi:10.1109/ReConFig.2008.66
88 ms
(Ver 3.3 (11022016))