Pairing Lattices

Florian Hess

Paper 2008/125

Pairing Lattices

Florian Hess

Abstract

We provide a convenient mathematical framework that essentially encompasses all known pairing functions based on the Tate pairing. We prove non-degeneracy and bounds on the lowest possible degree of these pairing functions and show how efficient endomorphisms can be used to achieve a further degree reduction.

Note: Further simplification for the lattice eil pairing.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: pairings
Contact author(s): hess @ math tu-berlin de
History: 2008-07-11: last of 5 revisions; 2008-03-23: received; See all versions
Short URL: https://ia.cr/2008/125
License: CC BY

BibTeX

@misc{cryptoeprint:2008/125,
      author = {Florian Hess},
      title = {Pairing Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/125},
      year = {2008},
      url = {https://eprint.iacr.org/2008/125}
}