Skip to main content
Article thumbnail
Location of Repository

A Performance Evaluation of ARM ISA Extension for Elliptic Curve Cryptography Over Binary Finite Fields

By Ro Bartolini, Irina Branovic, Roberto Giorgi and Enrico Martinelli

Abstract

In this paper, we present an evaluation of possible ARM instruction set extension for Elliptic Curve Cryptography (ECC) over binary finite fields GF(2 m). The use of elliptic curve cryptography is becoming common in embedded domain, where its reduced key size at a security level equivalent to standard publickey 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 33 % reduction of the total number of dynamically executed instructions, while execution time improves by the same amount when projective coordinates are used. 1

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.6919
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.dii.unisi.it/~giorg... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.