View : 19 Download: 0

Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - X ± 1

Title
Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - X ± 1
Authors
Lee E.Lee H.-S.Lee Y.
Ewha Authors
이향숙
SCOPUS Author ID
이향숙scopus
Issue Date
2007
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743JCR Link
Citation
vol. 4575 LNCS, pp. 349 - 366
Indexed
SCOPUS scopus
Abstract
Recent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duursma-Lee and Barreto et al. have focused on degenerate divisors. We present two efficient methods that work for general divisors to compute the Eta paring over divisor class groups of the hyperelliptic curves of genus 3. The first method generalizes the method of Barreto et al. so that it holds for general divisors, and we call it the pointwise method. For the second method, we take a novel approach using resultant. We focus on the case that two divisors of the pairing have supporting points in not in . Our analysis shows that the resultant method is faster than the pointwise method, and our implementation result supports the theoretical analysis. In addition to the fact that the two methods work for general divisors, they also provide very explicit algorithms. © 2007 Springer-Verlag Berlin Heidelberg.
DOI
10.1007/978-3-540-73489-5_20
ISBN
3540734880; 9783540734888
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE