Pairings for Cryptographers

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

Paper 2006/165 Original: eprint.iacr.org/2006/165 ↗

Pairings for Cryptographers

S. D. Galbraith

K. G. Paterson

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
Category: Public-key cryptography
Publication info: Preprint.
History: 2006-05-17: last updated; 2006-05-16: published
Short URL: https://ia.cr/2006/165
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2006/165}
}