arXiv subjects

Roger Oyono

Publications and source records attributed to Roger Oyono.

5 recordsLinked to original sources

arXiv2026

Minimal degree of an isogeny between a supersingular elliptic curve and its conjugate

Let $E$ be a supersingular elliptic curve defined over $\bar{\mathbb{F}}_p$ and $E^{(p)}$ be its conjugate. We give a bound on the minimal degree of an isogeny from $E$ to $E^{(p)}$ depending on $p$, and show that this bound is both asymptotically optimal as well as sharp in many cases. This bound is obtained by developing a new technique to compute the degree of certain isogenies from a supersingular elliptic curve to its conjugate, and we present extensive computations of the successive minima of the lattice containing these isogenies. Following this, we give several conjectures supported by the data we have obtained, including some on the set of primes $p$ for which the bound we give in this article is attained.

math.NT↗

arXiv2026

Non-hyperelliptic modular curves of genus 3

A curve $C$ defined over $\mathbb Q$ is modular of level $N$ if there exists a non-constant morphism from $X_1(N)$ onto $C$ defined over $\mathbb Q$ for some positive integer $N$. We provide a sufficient and necessary condition for the existence of a modular non-hyperelliptic curve $C$ of genus $3$ and level $N$ such that $\mathrm{Jac}{(C)}$ is $\mathbb Q$-isogenous to a given three dimensional $\mathbb Q$-quotient of $J_1 (N)$. Using this criterion, we present an algorithm to compute explicitly equations for modular non-hyperelliptic curves of genus $3$. Let $C$ be a modular curve of level $N$, we say that $C$ is new if the corresponding morphism between $J_1(N)$ and $\mathrm{Jac}{(C)}$ factors through the new part of $J_1(N)$.

math.NT↗

arXiv2023

Iterative constructions of irreducible polynomials from isogenies

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance, in odd characteristic, this is the case for the rational fraction $S=(x^2+1)/(2x)$, known as the $R$-transform, and for a positive density of all irreducible polynomials $f$. We interpret these transforms in terms of isogenies of elliptic curves. Using complex multiplication theory, we devise algorithms to generate a large number of other rational fractions $S$, each of which yields infinite families of irreducible polynomials for a positive density of starting irreducible polynomials $f$.

math.NT↗

arXiv2010

On rationality of the intersection points of a line with a plane quartic

We study the rationality of the intersection points of certain lines and smooth plane quartics C defined over F_q. For q \geq 127, we prove the existence of a line such that the intersection points with C are all rational. Using another approach, we further prove the existence of a tangent line with the same property as soon as the characteristic of F_q is different from 2 and q \geq 66^2+1. Finally, we study the probability of the existence of a rational flex on C and exhibit a curious behavior when the characteristic of F_q is equal to 3.

math.NT↗

arXiv2003

On Using Expansions to the Base of -2

This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed groups arising from Picard curves this leads to a saving of at least 7% for the computation of an m-fold. For more general non-hyperelliptic genus 3 curves we expect a larger speed-up.

math.NT↗