EUVIMEDEUVIMED entdecken
Crossref

High‐performance elliptic curve cryptography processor over NIST prime fields

Md Selim Hossain, Yinan Kong, Ehsan Saeedi, Niras C. Vayalil

IET Computers & Digital Techniques · 2017-01 · 11 (1) · 33-42

DOI: 10.1049/iet-cdt.2016.0033 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IET Computers & Digital Techniques, online erschienen am 30.11.2016. Verfasst von Md Selim Hossain und 3 weiteren Autor:innen. Die Arbeit wurde bisher 72-mal zitiert (Crossref) und nennt 28 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study presents a description of an efficient hardware implementation of an elliptic curve cryptography processor (ECP) for modern security applications. A high‐performance elliptic curve scalar multiplication (ECSM), which is the key operation of an ECP, is developed both in affine and Jacobian coordinates over a prime field of size p using the National Institute of Standards and Technology standard. A novel combined point doubling and point addition architecture is proposed using efficient modular arithmetic to achieve high speed and low hardware utilisation of the ECP in Jacobian coordinates. This new architecture has been synthesised both in application‐specific integrated circuit (ASIC) and field‐programmable gate array (FPGA). A 65 nm CMOS ASIC implementation of the proposed ECP in Jacobian coordinates takes between 0.56 and 0.73 ms for 224‐bit and 256‐bit elliptic curve cryptography, respectively. The ECSM is also implemented in an FPGA and provides a better delay performance than previous designs. The implemented design is area‐efficient and this means that it requires not many resources, without any digital signal processing (DSP) slices, on an FPGA. Moreover, the area–delay product of this design is very low compared with similar designs. To the best of the authors’ knowledge, the ECP proposed in this study over performs better than available hardware in terms of area and timing.

Zitieren

APA

Hossain, M. S., Kong, Y., Saeedi, E., & Vayalil, N. C. (2017). High‐performance elliptic curve cryptography processor over NIST prime fields. IET Computers & Digital Techniques, 11(1), 33-42. https://doi.org/10.1049/iet-cdt.2016.0033

Vancouver

Hossain MS, Kong Y, Saeedi E, Vayalil NC. High‐performance elliptic curve cryptography processor over NIST prime fields. IET Computers & Digital Techniques. 2017;11(1):33-42. doi:10.1049/iet-cdt.2016.0033

BibTeX
@article{Hossain2017,
  author = {Hossain, Md Selim and Kong, Yinan and Saeedi, Ehsan and Vayalil, Niras C.},
  title = {High‐performance elliptic curve cryptography processor over NIST prime fields},
  journal = {IET Computers & Digital Techniques},
  year = {2017},
  volume = {11},
  number = {1},
  pages = {33--42},
  doi = {10.1049/iet-cdt.2016.0033}
}
Kostenlos starten →