Although cryptographic software implementation is often performed by expert programmers, the range of performance and security driven options, as well as more mundane software engineering issues, still make it a challenge. The use of domain specific language and compiler techniques to assist in description and optimisation of cryptographic software is an interesting research challenge. In this paper we investigate two aspects of such techniques, focusing on Elliptic Curve Cryptography (ECC) in particular. Our constructive results show that a suitable language allows description of ECC based software in a manner close to the original mathematics; the corresponding compiler allows automatic production of an executable whose performance is competitive with that of a hand-optimised implementation. In contrast, we study the worrying potential for naïve compiler driven optimisation to render cryptographic software insecure. Both aspects of our work are set within the context of CACE, an ongoing EU funded project on this general topic. © 2008 International Association for Cryptologic Research.
CITATION STYLE
Barbosa, M., Moss, A., & Page, D. (2009). Constructive and destructive use of compilers in elliptic curve cryptography. Journal of Cryptology, 22(2), 259–281. https://doi.org/10.1007/s00145-008-9023-0
Mendeley helps you to discover research relevant for your work.