Related papers: A p-adic Height Function Of Cryptanalytic Signific…

We describe an algorithm for listing all elements of bounded height in a given number field.

This paper presents certains aspects of the mathematics of Aryabhata that are of interest to the cryptography community.

We study the behavior of canonical height functions $\widehat{h}_f$, associated to rational maps $f$, on totally $p$-adic fields. In particular, we prove that there is a gap between zero and the next smallest value of $\widehat{h}_f$ on the…

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

Dwork's $p$-adic hypergeometric function is defined to be a ratio ${}_sF_{s-1}(t)/{}_sF_{s-1}(t^p)$ of hypergeometric power series. Dwork showed that it is a uniform limit of rational functions, and hence one can define special values on…

We present an efficient algorithm for computing certain special values of Rankin triple product $p$-adic L-functions and give an application of this to the explicit construction of rational points on elliptic curves.

Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…

We present various improvements to the deformation method for computing the zeta function of smooth projective hypersurfaces over finite fields using $p$-adic cohomology. This includes new bounds for the $p$-adic and $t$-adic precisions…

We define a new canonical height pairing on the rational points of elliptic curves over global function fields which takes values in the multiplicative group of a completion of the function field. This height serves as an analogue of both…

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

We introduce an algorithm that can be used to compute the canonical height of a point on an elliptic curve over the rationals in quasi-linear time. As in most previous algorithms, we decompose the difference between the canonical and the…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

Let $X$ be a curve of genus $g>1$ over $\mathbb{Q}$ whose Jacobian $J$ has Mordell--Weil rank $r$ and N\'eron--Severi rank $\rho$. When $r < g+ \rho - 1$, the geometric quadratic Chabauty method determines a finite set of $p$-adic points…

Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…

We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…

Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…

We develop the theory and practical implementation of p-adic sparse coding of data. Rather than the standard, sparsifying criterion that uses the $L_0$ pseudo-norm, we use the p-adic norm. We require that the hierarchy or tree be…

Coleman's theory of p-adic integration figures prominently in several number-theoretic applications, such as finding torsion and rational points on curves, and computing p-adic regulators in K-theory (including p-adic heights on elliptic…