The geometry of flex tangents to a cubic curve and its parameterizations
This article's concern is the problem of producing points in elliptic curves over finite fields. One way is to find a so-called pseudo-parametrization, that is, a parametrization using field operations and extraction of cubic roots. Here this is achieved by studying the dual of the elliptic curve (take a nonsingular plane cubic model), which itself is an algebraic curve. The idea is as follows: one can cut the elliptic curve \(C\) by a family \(L_t\) of lines depending rationally on a parameter \(t\), producing triples of points whose coordinates are calculated by solving cubic equations. This solution involves a square root extraction, so one looks for lines such that the discriminant of the intersection is actually a square. Now, dual space is the set of lines of the projective plane, and those lines intersecting \(C\) in multiple points (that is, tangents and flexes) make up the dual curve \(\widehat{C}\); given a family of lines, the discriminant of \(L_t\cdot C\) describes the intersections between the rational curve \(L\) (in dual space) and \(\widehat{C}\). But this discriminant is a square precisely when every point of \(L\cdot\widehat{C}\) has even multiplicity. The geometric aspect is that the nine flexes of an elliptic cube correspond to nine cusps on the dual curve. The game is then to find rational curves in dual space that pass through some of these cusps and have only even intersections. The conclusion is that several pseudo-parametrizations shown in other articles can be produced with this geometric method, indeed the authors show how infinitely many inequivalent ones arise from different choices of rational curves. There is also a connection to rational curves on \(K3\) surfaces.
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Algebraic surfaces: with appendices by S. S. Abhyankar, J. Lipman and D. Mumford.
- Algorithmic Number Theory
- Counting rational curves on \(K3\) surfaces
- Elliptic surfaces
- Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
- Hashing into Hessian curves
- How to Hash into Elliptic Curves
- scientific article; zbMATH DE number 3933219 (Why is no real title available?)
- scientific article; zbMATH DE number 3944020 (Why is no real title available?)
- scientific article; zbMATH DE number 1222888 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- Identity-Based Encryption from the Weil Pairing
- Radical parametrizations of algebraic curves by adjoint curves
- Rational algebraic curves. A computer algebra approach
- Réseaux de Kummer et surfaces K3. (Kummer lattices and K3 surfaces)
- Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19
- The number of points on an algebraic curve over a finite field
- The number of rational curves on \(K3\) surfaces
- Yau-Zaslow formula on K3 surfaces for non-primitive classes
- Constructing cubic curves with involutions
- The geometry of some parameterizations and encodings
- Choosing points on cubic plane curves: rigidity and flexibility
- scientific article; zbMATH DE number 5499705 (Why is no real title available?)
- The elliptic parameterization of cubic curves by Alfred Clebsch
- Points of ninth order on cubic curves
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- Improved elliptic curve hashing and point representation
This page was built for publication: The geometry of flex tangents to a cubic curve and its parameterizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765860)
