Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / pairings

Date: received 17 Mar 2008, last revised 11 Jul 2008

Contact author: hess at math tu-berlin de

Available format(s): PDF | BibTeX Citation

Note: Further simplification for the lattice eil pairing.

Version: 20080711:223548 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]