Related papers: Cubic Curves, Finite Geometry and Cryptography

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…

Integer geometry on a plane deals with objects whose vertices are points in $\mathbb Z^2$. The congruence relation is provided by all affine transformations preserving the lattice $\mathbb Z^2$. In this paper we study circumscribed circles…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

For decades, de Casteljau's algorithm has been used as a fundamental building block in curve and surface design and has found a wide range of applications in fields such as scientific computing, and discrete geometry to name but a few. With…

We study linearizability of actions of finite groups on cubic threefolds with non-isolated singularities.

We describe the Hilbert schemes parametrizing curves on a cubic threefold of degree at most 5. In a forthcoming paper, we use this description to give a new proof and extension of a theorem of Iliev, Markushevich and Tikhimirov.

The study of alternative models for elliptic curves has found recent interest from cryptographic applications, once it was recognized that such models provide more efficiently computable algorithms for the group law than the standard…

In this paper, we study the deformations of curves in the projective 3-space $\mathbb P^3$ (space curves), one of the most classically studied objects in algebraic geometry. We prove a conjecture due to J. O. Kleppe (in fact, a version…

A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…

In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…

A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which…

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…

We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…

The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are discussed and an emerging link between them is outlined. It is shown that these methods employ a wide range of…

The ruled surfaces, i.e., surfaces generated by one parametric set of lines, are widely used in the~field of applied geometry. An~isophote on a surface is a curve consisting of surface points whose normals form a constant angle with some…

This paper presents an overview of the use of elliptic curves in cryptography. The security of this cryptosystem is based on the discrete logarithm problem, which appears to be much harder compared to the discrete logarithm problem in other…

Let C be a smooth cubic curve in the complex projective plane. We show that for every positive integer k, there are only finite number of rational curves of degree k each intersects the cubic C at exactly one point. The number of such…