Paper 2007/053

Compiler Assisted Elliptic Curve Cryptography

M. Barbosa, A. Moss, and D. Page

Abstract

Although cryptographic implementation tasks are often undertaken by expert programmers, a plethora of performance and security driven options, as well as more mundane software engineering issues, still make this a challenge. In an attempt to transfer expert knowledge into automated tools, we investigate the use of domain specific language and compilation techniques for cryptographic software, focusing on ECC in particular. Specifically, we describe experiments for specialisation of finite field arithmetic from general purpose code, and the description and optimisation of ECC point arithmetic using a cryptography-aware language and compiler. Our main results show that it is possible to allow description of ECC based software in a manner close to the original mathematics, while allowing the automatic production of an executable whose performance is close to that of a hand-optimised implementation.

Metadata
Available format(s)
PDF PS
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
compilersoptimisation
Contact author(s)
page @ cs bris ac uk
History
2007-02-28: revised
2007-02-20: received
See all versions
Short URL
https://ia.cr/2007/053
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/053,
      author = {M.  Barbosa and A.  Moss and D.  Page},
      title = {Compiler Assisted Elliptic Curve Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2007/053},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/053}},
      url = {https://eprint.iacr.org/2007/053}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.