CryptoDB
Pairing Lattices
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17802, title={Pairing Lattices}, booktitle={IACR Eprint archive}, keywords={foundations / pairings}, url={http://eprint.iacr.org/2008/125}, note={ hess@math.tu-berlin.de 14071 received 17 Mar 2008, last revised 11 Jul 2008}, author={Florian Hess}, year=2008 }