The geometry of flex tangents to a cubic curve and its parameterizations (Q765860): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2011.11.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127755092 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.3630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting rational curves on \(K3\) surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Réseaux de Kummer et surfaces K3. (Kummer lattices and K3 surfaces) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption from the Weil Pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4423053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hashing into Hessian Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Hash into Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yau-Zaslow formula on K3 surfaces for non-primitive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radical parametrizations of algebraic curves by adjoint curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational algebraic curves. A computer algebra approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of rational curves on \(K3\) surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic surfaces: with appendices by S. S. Abhyankar, J. Lipman and D. Mumford. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2011.11.003 / rank
 
Normal rank

Latest revision as of 03:11, 10 December 2024

scientific article
Language Label Description Also known as
English
The geometry of flex tangents to a cubic curve and its parameterizations
scientific article

    Statements

    The geometry of flex tangents to a cubic curve and its parameterizations (English)
    0 references
    22 March 2012
    0 references
    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.
    0 references
    0 references
    elliptic curves
    0 references
    cryptography
    0 references
    radical parametrization
    0 references
    \(K3\) surfaces
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references