In this paper we survey algorithms in literature for computing bilinear pairings and we present a new algorithm for the Tate pairing over supersingular \tzv, which exploits the action of the $q$-Frobenius. We give explicit examples and provide experimental results for supersingular \tzv defined over fields of characteristic 2. Moreover, in the same settings, we propose a more efficient variant of the Silverberg's point compression algorithm.
Category / Keywords: implementation / trace zero variety, supersingular elliptic curve, tate pairing, miller function Date: received 22 Sep 2008 Contact author: emanuele cesena at gmail com Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20080924:041018 (All versions of this report) Discussion forum: Show discussion | Start new discussion