Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
From MaRDI portal
Publication:3059657
DOI10.1007/978-3-642-17455-1_18zbMath1290.94100arXiv1005.1454OpenAlexW1567827026MaRDI QIDQ3059657
Guénaël Renault, Reynald Lercier, Jean-Gabriel Kammerer
Publication date: 26 November 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.1454
Separable extensions, Galois theory (12F10) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (10)
HECC (Hyperelliptic Curve Cryptography) ⋮ Constructing Permutation Rational Functions from Isogenies ⋮ \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves ⋮ Hashing into Hessian Curves ⋮ Improved elliptic curve hashing and point representation ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ The geometry of some parameterizations and encodings ⋮ On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2 ⋮ The geometry of flex tangents to a cubic curve and its parameterizations ⋮ Uniform encodings to elliptic curves and indistinguishable point representation
Uses Software
This page was built for publication: Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
