Login / Signup

A Weil Pairing on a Family of Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms.

Masahiro IshiiAtsuo InomataKazutoshi Fujikawa
Published in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2017)
Keyphrases
  • efficiently computable
  • sufficient conditions
  • upper bound
  • computationally hard
  • special case
  • b spline
  • perceptron algorithm
  • machine learning