Automata, Languages and Programming
From MaRDI portal
Publication:5716805
DOI10.1007/11523468zbMath1084.94016OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716805
Tetsuya Takahashi, Mitsuru Kawazoe, Mitsuhiro Haneda
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Curves over finite and local fields (11G20)
Related Items (5)
Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields ⋮ On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2
This page was built for publication: Automata, Languages and Programming
