Related papers: Deterministic elliptic curve primality proving for…

Probabilistic computing has been introduced to operate functional networks using a probabilistic bit (p-bit), generating 0 or 1 probabilistically from its electrical input. In contrast to quantum computers, probabilistic computing enables…

Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…

Let E be an elliptic curve having Complex Multiplication by the full ring O_K of integers of K=Q(\sqrt{-D}), let H=K(j(E)) be the Hilbert class field of K. Then the Mordell-Weil group E(H) is an O_K-module, and its structure denpends on its…

This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…

This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as curves of degree n in P^{n-1}. The methods we describe are practical in the case n=3 for…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…

Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by…

Let $E$ be an elliptic curve over the rationals that does not have complex multiplication. For each prime $\ell$, the action of the absolute Galois group on the $\ell$-torsion points of $E$ can be given in terms of a Galois representation…

Orientations of supersingular elliptic curves encode the information of an endomorphism of the curve. Computing the full endomorphism ring is a known hard problem, so one might consider how hard it is to find one such orientation. We prove…

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

N.Garc\'ia-Fritz and H.Pasten showed that Hilbert's 10th problem is unsolvable in the ring of integers of number fields of the form $\mathbb{Q}(\sqrt[3]{p},\sqrt{-q})$ for positive proportions of primes $p$ and $q$. We improve their…

We initiate a systematic study of pseudo-deterministic quantum algorithms. These are quantum algorithms that, for any input, output a canonical solution with high probability. Focusing on the query complexity model, our main contributions…

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let $E/\mathbb{Q}$ be a non-CM elliptic curve. Assuming GRH, we prove that, for a set of primes $p$ of density $1$, the absolute discriminant of the $\mathbb{F}_p$-endomorphism ring of the reduction of $E$ modulo $p$ is close to maximal.

Fix an elliptic curve E over Q. An extremal prime for E is a prime p of good reduction such that the number of rational points on E modulo p is maximal or minimal in relation to the Hasse bound. Assuming that all the symmetric power…

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Suppose that $E$ is an elliptic curve defined over $\mathbb{Q}$ without complex multiplication and with conductor $N$. For each positive integer $m$, the action of the absolute Galois group…