English
Related papers

Related papers: Kummer surfaces for primality testing

200 papers

In this paper, we will study the arithmetic of the Eisenstein part of the modular Jacobians. In the first section, we introduce some general preliminaries of the arithmetic theory of modular curves that we will need later. In the second…

Number Theory · Mathematics 2016-12-28 Yuan Ren

In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic…

Number Theory · Mathematics 2012-09-05 Razvan Barbulescu , Joppe W. Bos , Cyril Bouvier , Thorsten Kleinjung , Peter L. Montgomery

We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…

Number Theory · Mathematics 2025-01-17 Jean Kieffer

We consider the problem of Clifford testing, which asks whether a black-box $n$-qubit unitary is a Clifford unitary or at least $\varepsilon$-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this…

Quantum Physics · Physics 2025-10-09 Marcel Hinsche , Zongbo Bao , Philippe van Dordrecht , Jens Eisert , Jop Briët , Jonas Helsen

In this work we study the Humbert-Edge's curves of type 5, defined as a complete intersection of four diagonal quadrics in $\mathbb{P}^5$. We characterize them using Kummer surfaces and using the geometry of these surfaces we construct some…

Algebraic Geometry · Mathematics 2021-06-03 Abel Castorena , Juan Bosco Frías-Medina

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

Quantum Physics · Physics 2023-10-06 A. L. M. Southier , L. F. Santos , P. H. Souto Ribeiro , A. D. Ribeiro

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Number Theory · Mathematics 2014-02-26 Rafe Jones

Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…

Quantum Physics · Physics 2026-02-02 Marcello Benedetti , Harry Buhrman , Jordi Weggemans

We study the geometry of Nieto's quintic threefold (Barth & Nieto, J. Alg. Geom. 3, 1994) and the Kummer and abelian surfaces that correspond to special loci.

alg-geom · Mathematics 2007-05-23 K. Hulek , I. Nieto , G. K. Sankaran

This article presents a differential geometrical method for analyzing sequential test procedures. It is based on the primal result on the conformal geometry of statistical manifold developed in Kumon, Takemura and Takeuchi (2011). By…

Statistics Theory · Mathematics 2016-05-02 Masayuki Kumon , Akimichi Takemura , Kei Takeuchi

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Ming-Yang Kao

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

Number Theory · Mathematics 2007-05-23 David R. Kohel , Benjamin A. Smith

When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…

Numerical Analysis · Mathematics 2011-10-20 Jiawei Chiu , Laurent Demanet

The quantum many-body problem can be rephrased as a variational determination of the two-body reduced density matrix, subject to a set of N-representability constraints. The mathematical problem has the form of a semidefinite program. We…

Strongly Correlated Electrons · Physics 2011-10-27 B. Verstichel , H. van Aggelen , D. Van Neck , P. Bultinck , S. De Baerdemacker

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

Algebraic Geometry · Mathematics 2013-03-27 Natalia Dück , Karl-Heinz Zimmermann

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…

Quantum Physics · Physics 2023-07-21 Dominik Hangleiter , Jens Eisert

Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving…

Number Theory · Mathematics 2007-09-27 Preda Mihailescu

We explicitly compute family GW invariants of elliptic surfaces for primitive classes. That involves establishing a TRR formula and a symplectic sum formula for elliptic surfaces and then determining the GW invariants using an argument from…

Symplectic Geometry · Mathematics 2007-05-23 Junho Lee

In order to count the number of smooth cubic hypersurfaces tangent to a prescribed number of lines and passing through a given number of points, we construct a compactification of their moduli space. We term the latter a…

Algebraic Geometry · Mathematics 2022-01-17 Mara Belotti , Alessandro Danelon , Claudia Fevola , Andreas Kretschmer

We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$…

Number Theory · Mathematics 2018-11-16 Tejas R. Rao