Related papers: Class invariants by the CRT method
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
One can define class invariants for a quartic primitive CM field K as special values of certain Siegel (or Hilbert) modular functions at CM points corresponding to K. We provide explicit bounds on the primes appearing in the denominators of…
By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…
We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…
We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We consider a class of inexact Newton regularization methods for solving nonlinear inverse problems in Hilbert scales. Under certain conditions we obtain the order optimal convergence rate result.
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
We present an unconditional CRT algorithm to compute the modular polynomial $\Phi_\ell(X,Y)$ in quasi-linear time. The main ingredients of our algorithm are: the embedding of $\ell$-isogenies in smooth-degree isogenies in higher dimension,…
This paper presents algebraic methods for the study of polynomial relative invariants, when the group G formed by the symmetries and relative symmetries is a compact Lie group. We deal with the case when the subgroup H of symmetries is…
A notion of curvature is introduced in multivariable operator theory and an analogue of the Gauss-Bonnet-Chern theorem is established for graded (contractive) Hilbert modules over the complex polynomial algebra in d variables, d=1,2,3,....…
We study the ring R(n,m) of invariants for the left-right action of SL_n \times SL_n on m-tuples of n by n complex matrices. We show that R(3,m) is generated by invariants of degree less equal 309 for all m. Then, we use a combinatorial…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.