Dominguez Perez, Luis J.; Scott, Michael Designing a code generator for pairing based cryptographic functions. (English) Zbl 1252.94059 Joye, Marc (ed.) et al., Pairing-based cryptography – Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17454-4/pbk). Lecture Notes in Computer Science 6487, 207-224 (2010). Summary: Pairing-based cryptography has become relevant in industry mainly because of the increasing interest in identity-based protocols. A major deterrent to the general use of pairing-based protocols is the complex nature of such protocols; efficient implementation of pairing functions is often difficult as it requires more knowledge than previous cryptographic primitives. In this paper we present a tool for automatically generating optimized code for pairing functions. Our cryptographic compiler chooses the most appropriate pairing function for the target family of curves, either the Tate, ate, R-ate or optimal pairing function, and generates its code. It also generates optimized code for the final exponentiation using the parameterisation of the chosen pairing-friendly elliptic curve.For the entire collection see [Zbl 1200.94008]. MSC: 94A60 Cryptography Keywords:pairings; implementation; code generator Software:Barreto-Naehrig PDFBibTeX XMLCite \textit{L. J. Dominguez Perez} and \textit{M. Scott}, Lect. Notes Comput. Sci. 6487, 207--224 (2010; Zbl 1252.94059) Full Text: DOI