@InProceedings{Bartolini04a,
author = "Bartolini, S. and Branovic, I. and Giorgi, R. and Martinelli, E.",
title = "A Performance Evaluation of ARM ISA Extension for Elliptic Curve Cryptography over Binary Finite Fields",
booktitle = "IEEE 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD-04)",
address = "Foz do Iguacu, Brasil",
rkey = "Cryptography, ISA, performance evaluation, Elliptic Curve Cryptography",
surl = "http://www.dii.unisi.it/~giorgi/papers/Bartolini04a.pdf",
month = "oct",
year = "2004",
isbn = "0-7695-2240-8",
issn = "1550-6533",
doi = "10.1109/SBAC-PAD.2004.5",
dxdo = "http://dx.doi.org/",
pages = "238--245",
abstract = "In this paper, we present an evaluation of possible ARM instruction set extension for Elliptic Curve Cryptography (ECC) over binary finite fields GF(2m). The use of elliptic curve cryptography is becoming common in embedded domain, where its reduced key size at a security level equivalent to standard public-key methods (such as RSA) allows for power consumption savings and more efficient operation. ARM processor was selected because it is widely used for embedded system applications. We developed an ECC benchmark set with three widely used public-key algorithms: Diffie-Hellman for key exchange, digital signature algorithm, as well as El-Gamal method for encryption/decryption. We analyzed the major bottlenecks at function level and evaluated the performance improvement, when we introduce some simple architectural support in the ARM ISA. Results of our experiments show that the use of a word-level multiplication instruction over binary field allows for an average 335 reduction of the total number of dynamically executed instructions, while execution time improves by the same amount when projective coordinates are used.",
dbmedia = "2",
wos="000225222600030",
scopus="2-s2.0-16244420738",
}