Related papers: Adventures in Supersingularland

The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…

A low storage algorithm for constructing isogenies between ordinary elliptic curves was proposed by Galbraith, Hess and Smart (GHS). We give an improvement of this algorithm by modifying the pseudorandom walk so that lower-degree isogenies…

Fix primes $p$ and $\ell$ with $\ell\neq p$. If $(A,\lambda)$ is a $g$-dimensional principally polarized abelian variety, an $(\ell)^g$-isogeny of $(A,\lambda)$ has kernel a maximal isotropic subgroup of the $\ell$-torsion of $A$; the image…

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Castryck, Decru, and Smith used superspecial genus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny cryptography, and recently, Costello and Smith devised an improved isogeny path-finding algorithm in the genus-2…

We enhance an isogeny graph of elliptic curves by incorporating level structures defined by bases of the kernels of iterates of the Verschiebung map. We extend several previous results on isogeny graphs with level structures defined by…

We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…

In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small endomorphism enables polynomial-time…

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each elliptic curve in the $\mathbb{Q}$-isogeny class…

We investigate stable operations in supersingular elliptic cohomology using isogenies of supersingular elliptic curves over finite fields. Our main results provide a framework in which we give a conceptually simple proof of an elliptic…

Famously, Kohel proved that isogeny graphs of ordinary elliptic curves are beautifully structured objects, now called volcanos. We prove graph structural theorems for abelian varieties of any dimension with commutative endomorphism ring and…

Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…

We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution…

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

Semi-supervised learning (SSL) is effectively used for numerous classification problems, thanks to its ability to make use of abundant unlabeled data. The main assumption of various SSL algorithms is that the nearby points on the data…

Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…

We address the problem of semi-supervised learning in relational networks, networks in which nodes are entities and links are the relationships or interactions between them. Typically this problem is confounded with the problem of…

We introduce a category of $\mathcal{O}$-orientedsupersingularellipticcurves and derive properties of the associated oriented and nonoriented $\ell$-isogeny supersingular isogeny graphs. As an application we introduce an oriented…

We define three different isogeny graphs of principally polarized superspecial abelian varieties, prove foundational results on them, and explain their role in number theory and geometry. This is background to joint work with Yevgeny…

For two positive integers $k$ and $\ell$, a $(k \times \ell)$-spindle is the union of $k$ pairwise internally vertex-disjoint directed paths with $\ell$ arcs between two vertices $u$ and $v$. We are interested in the (parameterized)…