Do you want to publish a course? Click here

Factorization of Hilbert class polynomials over prime fields

229   0   0.0 ( 0 )
 Added by Songsong Li
 Publication date 2021
  fields
and research's language is English




Ask ChatGPT about the research

Let $D$ be a negative integer congruent to $0$ or $1bmod{4}$ and $mathcal{O}=mathcal{O}_D$ be the corresponding order of $ K=mathbb{Q}(sqrt{D})$. The Hilbert class polynomial $H_D(x)$ is the minimal polynomial of the $j$-invariant $ j_D=j(mathbb{C}/mathcal{O})$ of $mathcal{O}$ over $K$. Let $n_D=(mathcal{O}_{mathbb{Q}( j_D)}:mathbb{Z}[ j_D])$ denote the index of $mathbb{Z}[ j_D]$ in the ring of integers of $mathbb{Q}(j_D)$. Suppose $p$ is any prime. We completely determine the factorization of $H_D(x)$ in $mathbb{F}_p[x]$ if either $p mid n_D$ or $p mid D$ is inert in $K$ and the $p$-adic valuation $v_p(n_D)leq 3$. As an application, we analyze the key space of Oriented Supersingular Isogeny Diffie-Hellman (OSIDH) protocol proposed by Col`o and Kohel in 2019 which is the roots set of the Hilbert class polynomial in $mathbb{F}_{p^2}$.



rate research

Read More

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are our main ingredients.
231 - Lucas Reis , Qiang Wang 2021
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multiplicative character sums, and characterizations of permutation polynomials.
120 - Jared Asuncion 2021
Let $K$ be a quartic CM field, that is, a totally imaginary quadratic extension of a real quadratic number field. In a 1962 article titled On the classfields obtained by complex multiplication of abelian varieties, Shimura considered a particular family ${F_K(m) : m in mathbb{Z} >0 }$ of abelian extensions of $K$, and showed that the Hilbert class field $H_K$ of $K$ is contained in $F_K(m)$ for some positive integer m. We make this m explicit. We then give an algorithm that computes a set of defining polynomials for the Hilbert class field using the field $F_K(m)$. Our proof-of-concept implementation of this algorithm computes a set of defining polynomials much faster than current implementations of the generic Kummer algorithm for certain examples of quartic CM fields.
In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا