Elliptic Gauss sums and applications to point counting (Q979143): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2010.01.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2019382035 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PRIMES is in P / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3361884 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast algorithms for computing isogenies between elliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3996190 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4293428 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3688455 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5301683 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3710637 / rank | |||
Normal rank |
Latest revision as of 23:34, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Elliptic Gauss sums and applications to point counting |
scientific article |
Statements
Elliptic Gauss sums and applications to point counting (English)
0 references
25 June 2010
0 references
Let \({\mathbb K}\) be a (finite) field and let \(f(X)\in {\mathbb K}[X]\) be a polynomial of degree \(n\). Assume that there exists a polynomial \(C(X)\in {\mathbb K}[X]\), whose \(m\)th iterate \(C\circ C\circ\ldots \circ C\) is denoted by \(C^{(m)}(X)\), such that the following properties are verified: A. \(f(C(X))\equiv 0\bmod f(X)\). B. \(C^{(n)}(X)-X\equiv 0\bmod f(X)\) and \((C^{(m)}(X)-X,f(X))=1\) for \(m<n\). Then the \({\mathbb K}\)-algebra \({\mathbf A}={\mathbb K}[X]/(f(X))\) is called a polynomial cyclic algebra with cyclicity polynomial \(C(X)\), and \(f(X)\) is called a cyclic polynomial.The authors study the structure of these algebras. Gauss and Jacobi sums over such algebras are applied for improving current algorithms for counting the number of points of elliptic curves over finite fields.
0 references
algorithms and complexity
0 references
elliptic curves over finite fields
0 references
Gauss sums and generalizations
0 references