Results 1  10
of
50
Speeding Up The Computations On An Elliptic Curve Using AdditionSubtraction Chains
 Theoretical Informatics and Applications
, 1990
"... We show how to compute x k using multiplications and divisions. We use this method in the context of elliptic curves for which a law exists with the property that division has the same cost as multiplication. Our best algorithm is 11.11% faster than the ordinary binary algorithm and speeds up acco ..."
Abstract

Cited by 100 (4 self)
 Add to MetaCart
We show how to compute x k using multiplications and divisions. We use this method in the context of elliptic curves for which a law exists with the property that division has the same cost as multiplication. Our best algorithm is 11.11% faster than the ordinary binary algorithm and speeds up accordingly the factorization and primality testing algorithms using elliptic curves. 1. Introduction. Recent algorithms used in primality testing and integer factorization make use of elliptic curves defined over finite fields or Artinian rings (cf. Section 2). One can define over these sets an abelian law. As a consequence, one can transpose over the corresponding groups all the classical algorithms that were designed over Z/NZ. In particular, one has the analogue of the p \Gamma 1 factorization algorithm of Pollard [29, 5, 20, 22], the Fermatlike primality testing algorithms [1, 14, 21, 26] and the public key cryptosystems based on RSA [30, 17, 19]. The basic operation performed on an elli...
Almost All Primes Can be Quickly Certified
"... This paper presents a new probabilistic primality test. Upon termination the test outputs "composite" or "prime", along with a short proof of correctness, which can be verified in deterministic polynomial time. The test is different from the tests of Miller [M], SolovayStrassen [SSI, and Rabin [R] ..."
Abstract

Cited by 69 (4 self)
 Add to MetaCart
This paper presents a new probabilistic primality test. Upon termination the test outputs "composite" or "prime", along with a short proof of correctness, which can be verified in deterministic polynomial time. The test is different from the tests of Miller [M], SolovayStrassen [SSI, and Rabin [R] in that its assertions of primality are certain, rather than being correct with high probability or dependent on an unproven assumption. Thc test terminates in expected polynomial time on all but at most an exponentially vanishing fraction of the inputs of length k, for every k. This result implies: • There exist an infinite set of primes which can be recognized in expected polynomial time. • Large certified primes can be generated in expected polynomial time. Under a very plausible condition on the distribution of primes in "small" intervals, the proposed algorithm can be shown'to run in expected polynomial time on every input. This
Elliptic spectra, the Witten genus and the theorem of the cube
 Invent. Math
, 1997
"... 2. More detailed results 7 2.1. The algebraic geometry of even periodic ring spectra 7 ..."
Abstract

Cited by 63 (16 self)
 Add to MetaCart
2. More detailed results 7 2.1. The algebraic geometry of even periodic ring spectra 7
Rational Points on Modular Elliptic Curves
"... Based on an NSFCBMS lecture series given by the author at the University of Central Florida in Orlando from August 8 to 12, 2001, this monograph surveys some recent developments in the arithmetic of modular elliptic curves, with special emphasis on the Birch and SwinnertonDyer conjecture, the ..."
Abstract

Cited by 31 (9 self)
 Add to MetaCart
Based on an NSFCBMS lecture series given by the author at the University of Central Florida in Orlando from August 8 to 12, 2001, this monograph surveys some recent developments in the arithmetic of modular elliptic curves, with special emphasis on the Birch and SwinnertonDyer conjecture, the construction of rational points on modular elliptic curves, and the crucial role played by modularity in shedding light on these questions.
Elliptic curves with large rank over function fields
, 2001
"... We produce explicit elliptic curves over Fp(t) whose MordellWeil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and SwinnertonDyer for these curves (or rather the Tate conjecture for related elliptic surfaces) and then use zeta functions to determine the rank. I ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
We produce explicit elliptic curves over Fp(t) whose MordellWeil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and SwinnertonDyer for these curves (or rather the Tate conjecture for related elliptic surfaces) and then use zeta functions to determine the rank. In contrast to earlier examples of Shafarevitch and Tate, our curves are not isotrivial. Asymptotically these curves have maximal rank for their conductor. Motivated by this fact, we make a conjecture about the growth of ranks of elliptic curves over number fields.
Primality testing using elliptic curves
 Journal of the ACM
, 1999
"... Abstract. We present a primality proving algorithm—a probabilistic primality test that produces short certificates of primality on prime inputs. We prove that the test runs in expected polynomial time for all but a vanishingly small fraction of the primes. As a corollary, we obtain an algorithm for ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
Abstract. We present a primality proving algorithm—a probabilistic primality test that produces short certificates of primality on prime inputs. We prove that the test runs in expected polynomial time for all but a vanishingly small fraction of the primes. As a corollary, we obtain an algorithm for generating large certified primes with distribution statistically close to uniform. Under the conjecture that the gap between consecutive primes is bounded by some polynomial in their size, the test is shown to run in expected polynomial time for all primes, yielding a Las Vegas primality test. Our test is based on a new methodology for applying group theory to the problem of prime certification, and the application of this methodology using groups generated by elliptic curves over finite fields. We note that our methodology and methods have been subsequently used and improved upon, most notably in the primality proving algorithm of Adleman and Huang using hyperelliptic curves and
On the passage from local to global in number theory
 Bull. Amer. Math. Soc. (N.S
, 1993
"... Would a reader be able to predict the branch of mathematics that is the subject of this article if its title had not included the phrase “in Number Theory”? The distinction “local ” versus “global”, with various connotations, has found a home in almost every part of mathematics, local problems being ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Would a reader be able to predict the branch of mathematics that is the subject of this article if its title had not included the phrase “in Number Theory”? The distinction “local ” versus “global”, with various connotations, has found a home in almost every part of mathematics, local problems being often a steppingstone to
Elliptic curves and analogies between number fields and function fields
 HEEGNER POINTS AND RANKIN LSERIES, EDITED BY HENRI DARMON AND SHOUWU
, 2004
"... Wellknown analogies between number fields and function fields have led to the transposition of many problems from one domain to the other. In this paper, we discuss traffic of this sort, in both directions, in the theory of elliptic curves. In the first part of the paper, we consider various works ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Wellknown analogies between number fields and function fields have led to the transposition of many problems from one domain to the other. In this paper, we discuss traffic of this sort, in both directions, in the theory of elliptic curves. In the first part of the paper, we consider various works on Heegner points and Gross–Zagier formulas in the function field context; these works lead to a complete proof of the conjecture of Birch and SwinnertonDyer for elliptic curves of analytic rank at most 1 over function fields of characteristic> 3. In the second part of the paper, we review the fact that the rank conjecture for elliptic curves over function fields is now known to be true, and that the curves which prove this have asymptotically maximal rank for their conductors. The fact that these curves meet rank bounds suggests interesting problems on elliptic curves over number fields, cyclotomic fields, and function fields over number fields. These
SYMPLECTIC AUTOMORPHISMS OF PRIME ORDER ON K3 SURFACES
, 2008
"... Abstract. We study algebraic K3 surfaces (defined over the complex number field) with a symplectic automorphism of prime order. In particular we consider the action of the automorphism on the second cohomology with integer coefficients (by a result of Nikulin this action is independent on the choice ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
Abstract. We study algebraic K3 surfaces (defined over the complex number field) with a symplectic automorphism of prime order. In particular we consider the action of the automorphism on the second cohomology with integer coefficients (by a result of Nikulin this action is independent on the choice of the K3 surface). With the help of elliptic fibrations we determine the invariant sublattice and its perpendicular complement, and show that the latter coincides with the CoxeterTodd lattice in the case of automorphism of order three. In the paper [Ni1] Nikulin studies finite abelian groups G acting symplectically (i.e. G H2,0(X,C) = id H2,0(X,C)) on K3 surfaces (defined over C). One of his main result is that the action induced by G on the cohomology group H2 (X, Z) is unique up to isometry. In [Ni1] all abelian finite groups of automorphisms of a K3 surface acting symplectically