z-logo
open-access-imgOpen Access
A new twofold Cornacchia-type algorithm and its applications
Author(s) -
Bei Wang,
Yi Ouyang,
Songsong Li,
Honggang Hu
Publication year - 2021
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2021026
Subject(s) - mathematics , iterated function , type (biology) , integer (computer science) , combinatorics , omega , algorithm , endomorphism , discrete mathematics , mathematical analysis , physics , quantum mechanics , biology , programming language , ecology , computer science
We focus on exploring more potential of Longa and Sica's algorithm (ASIACRYPT 2012), which is an elaborate iterated Cornacchia algorithm that can compute short bases for 4-GLV decompositions. The algorithm consists of two sub-algorithms, the first one in the ring of integers \begin{document}$ \mathbb{Z} $\end{document} and the second one in the Gaussian integer ring \begin{document}$ \mathbb{Z}[i] $\end{document} . We observe that \begin{document}$ \mathbb{Z}[i] $\end{document} in the second sub-algorithm can be replaced by another Euclidean domain \begin{document}$ \mathbb{Z}[\omega] $\end{document}\begin{document}$ (\omega = \frac{-1+\sqrt{-3}}{2}) $\end{document} . As a consequence, we design a new twofold Cornacchia-type algorithm with a theoretic upper bound of output \begin{document}$ C\cdot n^{1/4} $\end{document} , where \begin{document}$ C = \frac{3+\sqrt{3}}{2}\sqrt{1+|r|+|s|} $\end{document} with small values \begin{document}$ r, s $\end{document} given by the curves. The new twofold algorithm can be used to compute \begin{document}$ 4 $\end{document} -GLV decompositions on two classes of curves. First it gives a new and unified method to compute all \begin{document}$ 4 $\end{document} -GLV decompositions on \begin{document}$ j $\end{document} -invariant \begin{document}$ 0 $\end{document} elliptic curves over \begin{document}$ \mathbb{F}_{p^2} $\end{document} . Second it can be used to compute the \begin{document}$ 4 $\end{document} -GLV decomposition on the Jacobian of the hyperelliptic curve defined as \begin{document}$ \mathcal{C}/\mathbb{F}_{p}:y^{2} = x^{6}+ax^{3}+b $\end{document} , which has an endomorphism \begin{document}$ \phi $\end{document} with the characteristic equation \begin{document}$ \phi^2+\phi+1 = 0 $\end{document} (hence \begin{document}$ \mathbb{Z}[\phi] = \mathbb{Z}[\omega] $\end{document} ). As far as we know, none of the previous algorithms can be used to compute the \begin{document}$ 4 $\end{document} -GLV decomposition on the latter class of curves.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom