Searcharxiv⌕ Search

arXiv subjects

Kirsten Eisentraeger

Publications and source records attributed to Kirsten Eisentraeger.

At least 19 recordsLinked to original sources
arXiv2026

Connecting Kani's Lemma and path-finding in the Bruhat-Tits tree to compute supersingular endomorphism rings

We give a deterministic polynomial time algorithm to compute the endomorphism ring of a supersingular elliptic curve in characteristic p, provided that we are given two noncommuting endomorphisms and the factorization of the discriminant of the ring $\mathcal{O}_0$ they generate. At each prime $q$ for which $\mathcal{O}_0$ is not maximal, we compute the endomorphism ring locally by computing a q-maximal order containing it and, when $q \neq p$, recovering a path to $\text{End}(E) \otimes \mathbb{Z}_q$ in the Bruhat-Tits tree. We use techniques of higher-dimensional isogenies to navigate towards the local endomorphism ring. Our algorithm improves on a previous algorithm which requires a restricted input and runs in subexponential time under certain heuristics. Page and Wesolowski give a probabilistic polynomial time algorithm to compute the endomorphism ring on input of a single non-scalar endomorphism. Beyond using techniques of higher-dimensional isogenies to divide endomorphisms by a scalar, our methods are completely different.

math.NT↗
arXiv2023

A topological approach to undefinability in algebraic extensions of $\mathbb{Q}$

For any subset $Z \subseteq \mathbb{Q}$, consider the set $S_Z$ of subfields $L\subseteq \overline{\mathbb{Q}}$ which contain a co-infinite subset $C \subseteq L$ that is universally definable in $L$ such that $C \cap \mathbb{Q}=Z$. Placing a natural topology on the set $\text{Sub}(\overline{\mathbb{Q}})$ of subfields of $\overline{\mathbb{Q}}$, we show that if $Z$ is not thin in $\mathbb{Q}$, then $S_Z$ is meager in $\text{Sub}(\overline{\mathbb{Q}})$. Here, thin and meager both mean "small", in terms of arithmetic geometry and topology, respectively. For example, this implies that only a meager set of fields $L$ have the property that the ring of algebraic integers $\mathcal{O}_L$ is universally definable in $L$. The main tools are Hilbert's Irreducibility Theorem and a new normal form theorem for existential definitions. The normal form theorem, which may be of independent interest, says roughly that every $\exists$-definable subset of an algebraic extension of $\mathbb Q$ is a finite union of single points and projections of hypersurfaces defined by absolutely irreducible polynomials.

math.NT↗
arXiv2020

Computing endomorphism rings of supersingular elliptic curves and connections to pathfinding in isogeny graphs

Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this paper we give a new algorithm for computing the endomorphism ring of a supersingular elliptic curve $E$ that runs, under certain heuristics, in time $O((\log p)^2p^{1/2})$. The algorithm works by first finding two cycles of a certain form in the supersingular $\ell$-isogeny graph $G(p,\ell)$, generating an order $Λ\subseteq \operatorname{End}(E)$. Then all maximal orders containing $Λ$ are computed, extending work of Voight. The final step is to determine which of these maximal orders is the endomorphism ring. As part of the cycle finding algorithm, we give a lower bound on the set of all $j$-invariants $j$ that are adjacent to $j^p$ in $G(p,\ell)$, answering a question in arXiv:1909.07779.

math.NT↗
arXiv2018

Cycles in the supersingular $\ell$-isogeny graph and corresponding endomorphisms

We study the problem of generating the endomorphism ring of a supersingular elliptic curve by two cycles in $\ell$-isogeny graphs. We prove a necessary and sufficient condition for the two endomorphisms corresponding to two cycles to be linearly independent, expanding on the work in Kohel's thesis. We also give a criterion under which the order generated by two cycles is not a maximal order. We give some examples in which we compute cycles which generate the full endomorphism ring. The most difficult part of these computations is the calculation of the trace of these cycles. We show that a generalization of Schoof's algorithm can accomplish this computation efficiently.

math.NT↗
arXiv2018

Constructing Picard curves with complex multiplication using the Chinese Remainder Theorem

We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a sextic CM-field $K$ containing the cube roots of unity, we define and compute certain class polynomials modulo small primes and then use the Chinese Remainder Theorem to construct the class polynomials over the rationals. We also give some examples.

math.NT↗
arXiv2018

Universally and existentially definable subsets of global fields

We show that rings of $S$-integers of a global function field $K$ of odd characteristic are first-order universally definable in $K$. This extends work of Koenigsmann and Park who showed the same for $\mathbb{Z}$ in $\mathbb{Q}$ and the ring of integers in a number field, respectively. We also give another proof of a theorem of Poonen and show that the set of non-squares in a global field of characteristic $\neq 2$ is diophantine. Finally, we show that the set of pairs $(x,y)$ in $(K^{\times})^2$ such that $x$ is not a norm in $K(\sqrt{y})$ is diophantine over $K$ for any global field $K$ of characteristic $\neq 2$.

math.NT↗
arXiv2016

As Easy as $\mathbb Q$: Hilbert's Tenth Problem for Subrings of the Rationals and Number Fields

Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$ having the property that Hilbert's Tenth Problem for $R$, denoted $HTP(R)$, is Turing equivalent to $HTP(\mathbb Q)$. We are able to put several additional constraints on the rings $R$ that we construct. Given any computable nonnegative real number $r \leq 1$ we construct such a ring $R = Z[\frac1p : p \in S]$ with $S$ a set of primes of lower density $r$. We also construct examples of rings $R$ for which deciding membership in $R$ is Turing equivalent to deciding $HTP(R)$ and also equivalent to deciding $HTP(\mathbb Q)$. Alternatively, we can make $HTP(R)$ have arbitrary computably enumerable degree above $HTP(\mathbb Q)$. Finally, we show that the same can be done for subrings of number fields and their prime ideals.

math.NT↗
arXiv2013

Hilbert's Tenth Problem over Function Fields of Positive Characteristic Not Containing the Algebraic Closure of a Finite Field

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the undecidability proof for function fields of higher transcendence degree to characteristic 2 and show that the first-order theory of {\bf any} function field of positive characteristic is undecidable in the language of rings without parameters.

math.NT↗
arXiv2011

Hilbert's Tenth Problem and Mazur's Conjectures in Complementary Subrings of Number Fields

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K, a positive integer t>1, and t nonnegative computable real numbers delta_1,..., delta_t whose sum is one, we prove that the nonarchimedean primes of K can be partitioned into t disjoint recursive subsets S_1,..., S_t of densities delta_1,..., delta_t, respectively such that Hilbert's Tenth Problem is undecidable for each corresponding ring O_{K,S_i}. We also show that we can find a partition as above such that each ring O_{K,S_i} possesses an infinite Diophantine set which is discrete in every topology of the field. The only assumption on K we need is that there is an elliptic curve of rank one defined over K.

math.LO↗
arXiv2009

Pairings on hyperelliptic curves

We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research.

math.NT↗
arXiv2008

Descent on Elliptic Curves and Hilbert's Tenth Problem

Descent via an isogeny on an elliptic curve is used to construct two subrings of the field of rational numbers, which are complementary in a strong sense, and for which Hilbert's Tenth Problem is undecidable. This method further develops that of Poonen, who used elliptic divisibility sequences to obtain undecidability results for some large subrings of the rational numbers.

math.NT↗
arXiv2008

Undecidability in function fields of positive characteristic

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field, we can also prove undecidability in characteristic 2. The proof uses a result by Moret-Bailly about ranks of elliptic curves over function fields.

math.NT↗
arXiv2007

A CRT algorithm for constructing genus 2 curves over finite fields

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for discrete-log based cryptosystems. Our algorithm provides an alternative to the traditional CM method for constructing genus 2 curves. For a quartic CM field K with primitive CM type, we compute the Igusa class polynomials modulo p for certain small primes p and then use the Chinese remainder theorem (CRT) and a bound on the denominators to construct the class polynomials. We also provide an algorithm for determining endomorphism rings of ordinary Jacobians of genus 2 curves over finite fields, generalizing the work of Kohel for elliptic curves.

math.NT↗
arXiv2006

Hilbert's Tenth Problem for function fields of characteristic zero

In this article we outline the methods that are used to prove undecidability of Hilbert's Tenth Problem for function fields of characteristic zero. Following Denef we show how rank one elliptic curves can be used to prove undecidability for rational function fields over formally real fields. We also sketch the undecidability proofs for function fields of varieties over the complex numbers of dimension at least 2.

math.NT↗
arXiv2006

Integrality at a prime for global fields and the perfect closure of global fields of characteristic p>2

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of a global field of characteristic p>2. We also prove that the set of all elements of k^{perf} which are integral at some prime \qq of k^{perf} is diophantine over k^{perf}, and this is the first such result for a field which is not finitely generated over its constant field. This is related to Hilbert's Tenth Problem because for global fields k of positive characteristic, giving a diophantine definition of the set of elements that are integral at a prime is one of two steps needed to prove that Hilbert's Tenth Problem for k is undecidable.

math.NT↗
arXiv2006

Hilbert's Tenth Problem for function fields of varieties over C

Let K be the function field of a variety of dimension at least 2 over an algebraically closed field of characteristic zero. Then Hilbert's Tenth Problem for K is undecidable. This generalizes the result by Kim and Roush from 1992 that Hilbert's Tenth Problem for the purely transcendental function field C(t_1,t_2) is undecidable.

math.NT↗
arXiv2004

Improved Weil and Tate pairings for elliptic and hyperelliptic curves

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our pairings save about 20-30% over the usual pairings.

math.NT↗