SearcharxivSearch

arXiv subjects

Yuji Hashimoto

Publications and source records attributed to Yuji Hashimoto.

3 recordsLinked to original sources

Ordinary 3-Isogeny Graphs and Improvement of Supersingularity Testing for Twisted Hessian Curves over Prime Fields

For any primes $p \neq \ell$, $\ell$-isogeny graphs of ordinary elliptic curves defined over $\mathbb{F}_{p^2}$ have a typical structure called $\ell$-volcanoes, and the structure is the core of Sutherland's supersingularity testing algorithm for elliptic curves. In this paper, by exploiting the properties of $3$-isogenies between twisted Hessian curves, we show that when $p \equiv 2 \pmod{3}$ and $\ell = 3$, every ordinary twisted Hessian curve defined over $\mathbb{F}_p$ lies on the surface of the $3$-volcano. As an application, we give an improved version of Sutherland's supersingularity testing algorithm specialized to twisted Hessian curves defined over $\mathbb{F}_p$ with $p \equiv 2 \pmod{3}$. We also give a generalization of the known fact that any supersingular $j$-invariant is a cube in $\mathbb{F}_{p^2}$; we show that for any twisted Hessian curve $H(a,d)$ defined over $\mathbb{F}_{p^2}$, its $j$-invariant is not a cube in $\mathbb{F}_{p^2}$ if and only if $H(a,d)$ is ordinary and lies on the floor of a $3$-volcano.

math.NT

Bounds on Heights of $2$-isogeny Graphs in Ordinary Curves over $\mathbb{F}_p$ and $\mathbb{F}_{p^2}$ and Its Application

It is known that any isogeny graph consisting of ordinary elliptic curves over $\mathbb{F}_q$ with $q = p$ or $p^2$ has a special structure, called a volcano graph. We have a bound $h < \log_2 \sqrt{4q}$ of a height $h$ of the $2$-volcano graph. In this paper, we improve the bound on a height of $2$-volcano graphs over $\mathbb{F}_q$. In case $q = p^2$, we show a tighter bound $h \leq \left\lfloor \frac{ 1 }{ 2 } \lfloor \log_2 p \rfloor \right\rfloor + 2 $. In case $q = p$, we also show that a good bound for each prime $p$ can be computed by using our proposed techniques.

math.NT

Secure Grouping Protocol Using a Deck of Cards

We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.

cs.CR