Pairings for Cryptographers

S. D.  Galbraith; K. G.  Paterson; N. P.  Smart

eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2006/165

Pairings for Cryptographers

S. D. Galbraith, K. G. Paterson, and N. P. Smart

Abstract

Many research papers in pairing based cryptography treat pairings as a ``black box''. These papers build cryptographic schemes making use of various properties of pairings. If this approach is taken, then it is easy for authors to make invalid assumptions concerning the properties of pairings. The cryptographic schemes developed may not be realizable in practice, or may not be as efficient as the authors assume. The aim of this paper is to outline, in as simple a fashion as possible, the basic choices that are available when using pairings in cryptography. For each choice, the main properties and efficiency issues are summarized. The paper is intended to be of use to non-specialists who are interested in using pairings to design cryptographic schemes.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Pairings
Contact author(s): nigel @ cs bris ac uk
History: 2006-05-17: revised; 2006-05-16: received; See all versions
Short URL: https://ia.cr/2006/165
License: CC BY

BibTeX

@misc{cryptoeprint:2006/165,
      author = {S. D.  Galbraith and K. G.  Paterson and N. P.  Smart},
      title = {Pairings for Cryptographers},
      howpublished = {Cryptology ePrint Archive, Paper 2006/165},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/165}},
      url = {https://eprint.iacr.org/2006/165}
}