Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time

DOI10.1007/978-3-642-17455-1_18MaRDI QIDQ3059657zbMATH OpenOpenAlexFDO

Authors Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault

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

zbMATH Keywords

deterministic encodingelliptic curvesGalois theoryhyperelliptic curves

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Abstract: We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

Recommendations

• Deterministic encoding and hashing to odd hyperelliptic curves
• Efficient encodings to hyperelliptic curves over finite fields
• On indifferentiable hashing into the Jacobian of hyperelliptic curves of genus 2
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• Hashing into Hessian curves

Cited in

(25)

• Unified formulas for some deterministic almost-injective encodings into hyperelliptic curves
• The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
• Hashing into twisted Jacobi intersection curves
• Hash functions from superspecial genus-2 curves using Richelot isogenies
• Hashing to elliptic curves of \(j\)-invariant 1728
• The geometry of some parameterizations and encodings
• Deterministic encoding into twisted Edwards curves
• Probabilistic admissible encoding on elliptic curves -- towards PACE with generalized integrated mapping
• Impossibility of surjective Icart-like encodings
• An algorithm for generating rational points and hash functions into elliptic curves
• Hashing into Hessian curves
• Deterministic encoding and hashing to odd hyperelliptic curves
• Constructing permutation rational functions from isogenies
• Efficient encodings to hyperelliptic curves over finite fields
• Embedding finite fields into elliptic curves
• Hashing into Hessian curves
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• On indifferentiable hashing into the Jacobian of hyperelliptic curves of genus 2
• HECC (hyperelliptic curve cryptography)
• Improved elliptic curve hashing and point representation
• Hashing into generalized Huff curves
• \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
• \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
• The geometry of flex tangents to a cubic curve and its parameterizations
• Uniform encodings to elliptic curves and indistinguishable point representation

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059657)