Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms.

Xinxin Fan Guang Gong David Jao

Published in: Pairing (2008)

Keyphrases

efficiently computable
upper bound
sufficient conditions
computationally hard
lower bound
b spline
exact solution
winnow algorithm
special case
np hard
multi class
kernel function
decision problems
integer programming
perceptron algorithm