The geometry of some parameterizations and encodings
The paper deals with the problem of the parameterization by radicals (of degree prime to \(q(q-1)\))\, of algebraic curves of small genus (mainly genus 2) defined over a finite field \(\mathbb{F}_q\),\, of characteristic different from 2 and 3. A such parameterization would allow an efficient deterministic encodings into those curves. Encoding algorithms for elliptic curves are already known, see [\textit{T. Icart}, Lect. Notes Comput. Sci. 5677, 303--316 (2009; Zbl 1252.94075)], but for genus 2 curves only partial results were known, results only valid for a negligible proportion of all genus 2 curves, see Kammerer, Lercier and Renault [\textit{J.-G. Kammerer} et al., Lect. Notes Comput. Sci. 6487, 278--297 (2010; Zbl 1290.94100)]. Section 2 begins remembering the basic notions of parameterizations, encoding and torsors. Then Tartaglia-Cardan formulae is formulated in the language of torsors and the proposed method of parametrization is showed (2.7 and 2.8). This general method is illustrated in Section 3 for elliptic curves. Section 4 studies the case of genus 2 curves having two rational points whose difference has order 3 in the associated Jacobian variety. This allows to parameterize by 3-radicals a positive proportion of all genus 2 curves. An example (over \(\mathbb{F}_{83}\)) is worked in detail. Finally the paper studies other parameterizations by \(l\)-radicals, in particular for \(l=5\).
- Efficient encodings to hyperelliptic curves over finite fields
- Modular equations for hyperelliptic curves
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- A CM construction for curves of genus 2 with \(p\)-rank 1
- A CRT algorithm for constructing genus 2 curves over finite fields
- Unified formulas for some deterministic almost-injective encodings into hyperelliptic curves
- Radical parametrizations of algebraic curves by adjoint curves
- Computing equations of curves with many points
- Computing isogenies between Jacobians of curves of genus 2 and 3
- 5-TORSION POINTS ON CURVES OF GENUS 2
- Algebraic Function Fields and Codes
- Algorithmic Number Theory
- Arithmetic variety of moduli for genus two
- Deterministic encoding and hashing to odd hyperelliptic curves
- Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
- Explicit solution by radicals, gonal maps and plane models of algebraic curves of genus 5 or 6
- Fast computation of isomorphisms of hyperelliptic curves and explicit Galois descent
- Hashing into Hessian curves
- How to Hash into Elliptic Curves
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 4152568 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1391019 (Why is no real title available?)
- On Equations y2=xn+k in a Finite Field
- Points on elliptic curves over finite fields
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- The geometry of flex tangents to a cubic curve and its parameterizations
This page was built for publication: The geometry of some parameterizations and encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513762)