Related papers: The complexity of elliptic normal bases
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…
We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…
The complexities of self-dual normal bases, which are candidates for the lowest complexity basis of some defined extensions, are determined with the help of the number of all but the simple points in well chosen minimal Besicovitch…
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer…
In this paper, we continue the recent work of Fukshansky and Maharaj on lattices from elliptic curves over finite fields. We show that there exist bases formed by minimal vectors for these lattices except only one case. We also compute…
This thesis examines the relationship between elliptic curves with complex multiplication and Lambda structures. Our main result is to show that the moduli stack of elliptic curves with complex multiplication, and the universal elliptic…
This survey describes, at an introductory level, the algebraic complexity framework originally proposed by Leslie Valiant in 1979, and some of the insights that have been obtained more recently.
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
The complexity of dual basis of a type I optimal normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$ was determined to be $3n-3$ or $3n-2$ according as $q$ is even or odd, respectively, by Z.-X. Wan and K. Zhou in 2007. We give a new…
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…
We compute the complexity of the billiard language of the regular Euclidean $N$-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting…
In this paper we treat certain elliptic and hyper-elliptic integrals in a unified way. We introduce a new basis of these integrals coming from certain basis ${\phi}_n(x)$ of polynomials and show that the transition matrix between this basis…
General structure of the multivariate plain and q-hypergeometric terms and univariate elliptic hypergeometric terms is described. Some explicit examples of the totally elliptic hypergeometric terms leading to multidimensional integrals on…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…