中文
相关论文

相关论文: Primality proving using elliptic curves with compl…

200 篇论文

In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…

数论 · 数学 2007-11-27 Lassina Dembele , Steve Donnelly

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…

数论 · 数学 2010-04-14 Graham Everest , Ouamporn Phuksuwan , Shaun Stevens

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

数论 · 数学 2019-02-20 François Morain , Charlotte Scribot , Benjamin Smith

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

数论 · 数学 2026-02-20 Maarten Derickx , Kenji Terao

A formula for the class number $h$ of the imaginary quadratic field $Q(\sqrt{-p}$ is obtained by counting on a specific way the quadratic residues of a prime number of the form $p=4n-1.$ Formulas for the sum of the quadratic residues are…

数论 · 数学 2022-01-20 Jorge Garcia

In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.

数论 · 数学 2012-12-11 Akiko Ito

In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar…

密码学与安全 · 计算机科学 2016-12-09 Christophe Giraud , Vincent Verneuil

We present an algorithm for computing the prime factorisation of a knot, which is practical in the following sense: using Regina, we give an implementation that works well for inputs of reasonable size, including prime knots from the…

几何拓扑 · 数学 2025-04-08 Alexander He , Eric Sedgwick , Jonathan Spreer

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

数论 · 数学 2007-05-23 Anton Deitmar , Mark Pavey

In this article we show how to generalize to the Darbouxian, Liouvillian and Riccati case the extactic curve introduced by J. Pereira. With this approach, we get new algorithms for computing, if it exists, a rational, Darbouxian,…

符号计算 · 计算机科学 2018-12-20 Guillaume Chèze , Thierry Combot

The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…

数论 · 数学 2015-05-13 Romain Cosset

We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication…

数论 · 数学 2007-05-23 Kirsten Eisentraeger , Kristin Lauter , Peter L. Montgomery

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

数论 · 数学 2025-02-25 Guido Lido

We determine all possible degrees of cyclic isogenies of non-CM elliptic curves with rational $j$-invariant over number fields of degree $p$, where $p$ is an odd prime. The question had been answered for $p=2$, so this paper completes the…

数论 · 数学 2024-11-06 Ivan Novak

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

数论 · 数学 2017-01-03 Igor E. Shparlinski , Andrew V. Sutherland

The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing…

组合数学 · 数学 2015-01-16 Valentino Lanzone , Gábor P. Nagy

An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…

数论 · 数学 2021-11-17 Laszlo Remete

Let $\ell$ and $p \geq 3$ be distinct prime numbers. Let $E/\mathbb{Q}_{\ell}$ be an elliptic curve with $p$-torsion module $E_p$. Let $\mathbb{Q}_{\ell}(E_p)$ be the $p$-torsion field of $E$. We provide a complete description of the degree…

数论 · 数学 2018-04-23 Nuno Freitas , Alain Kraus

A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…

数论 · 数学 2021-10-04 Momonari Kudo , Shushi Harashita

The Lyness map is a birational map in the plane which provides one of the simplest discrete analogues of a Hamiltonian system with one degree of freedom, having a conserved quantity and an invariant symplectic form. As an example of a…

数论 · 数学 2020-02-11 Andrew N. W. Hone