Results 1 
9 of
9
Elliptic Curves And Primality Proving
 Math. Comp
, 1993
"... The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. ..."
Abstract

Cited by 190 (22 self)
 Add to MetaCart
(Show Context)
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.
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 106 (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...
Elliptic Curves, Primality Proving And Some Titanic Primes
, 1989
"... We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic . 1. Introduction. During the last ten years, primality testing evolved at great speed. Motivated by the RSA cryptosystem [3], the first deterministic primality proving algorithm was de ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic . 1. Introduction. During the last ten years, primality testing evolved at great speed. Motivated by the RSA cryptosystem [3], the first deterministic primality proving algorithm was designed by Adleman, Pomerance and Rumely [2] and made practical by Cohen, H. W. Lenstra and A. K. Lenstra (see [9, 10] and more recently [5]). It was then proved that the time needed to test an arbitrary integer N for primality is O((log N) c log log log N ) for some positive constant c ? 0. When implemented on a huge computer, the algorithm was able to test 200 digit numbers in about 10 minutes of CPU time. A few years ago, Goldwasser and Kilian [11], used the theory of elliptic curves over finite fields to give the first primality proving algorithm whose running time is polynomial in log N (assuming a plausible conjecture in number theory). Atkin [4] used the theory of complex multiplicat...
Construction Of Hilbert Class Fields Of Imaginary Quadratic Fields And Dihedral Equations Modulo p
, 1989
"... . The implementation of the AtkinGoldwasserKilian primality testing algorithm requires the construction of the Hilbert class field of an imaginary quadratic field. We describe the computation of a defining equation for this field in terms of Weber's class invariants. The polynomial we obtain, ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
. The implementation of the AtkinGoldwasserKilian primality testing algorithm requires the construction of the Hilbert class field of an imaginary quadratic field. We describe the computation of a defining equation for this field in terms of Weber's class invariants. The polynomial we obtain, noted W(X), has a solvable Galois group. When this group is dihedral, we show how to express the roots of this polynomial in terms of radicals. We then use these expressions to solve the equation W(X) j 0 mod p, where p is a prime. 1 Hilbert polynomials 1.1 Weber's functions We first introduce some functions. Let z be any complex number and put q = exp(2ißz). Dedekind's j function is defined by [21, x24 p. 85] j(z) = j(q) = q 1=24 Y m1 (1 \Gamma q m ): (1) We can expand j as [21, x34 p. 112] j(q) = q 1=24 0 @ 1 + X n1 (\Gamma1) n (q n(3n\Gamma1)=2 + q n(3n+1)=2 ) 1 A : (2) The Weber's functions are [21, x34 p. 114] f(z) = e \Gammaiß=24 j( z+1 2 ) j(z) ; (3) f 1 (z) = j...
DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3
, 1991
"... We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65digit (2^3539+ l)/3, the fir ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65digit (2^3539+ l)/3, the first ordinary Titanic prime.
Atkin's test: news from the front
 IN ADVANCES IN CRYPTOLOGY
, 1990
"... We make an attempt to compare the speed of some primality testing algorithms for certifying 100digit prime numbers. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We make an attempt to compare the speed of some primality testing algorithms for certifying 100digit prime numbers.
LIPS  A system for distributed applications
"... We present a software system for the distributed implementation of algorithms in networks of UNIX workstations. 1 Introduction In 1987 R.D. Silverman [SIL87] had the idea to use the idle time of the UNIX workstations of his company for the factorization of large integers. Silverman's distri ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a software system for the distributed implementation of algorithms in networks of UNIX workstations. 1 Introduction In 1987 R.D. Silverman [SIL87] had the idea to use the idle time of the UNIX workstations of his company for the factorization of large integers. Silverman's distributed implementation of the Multiple Polynomial Quadratic Sieve algorithm was very successful. Using that implementation, Silverman was the first to factor a 87 digit number [GAN]. This idea was developed further by A.K. Lenstra and M. Manasse [LEN90] who even used the electronic mail network to factor the Fermat number F 9 . Distributed computing in networks was also used by F. Morain [MOR88] in his implementation of the Goldwasser  Kilian  Atkin primality test. Those implementations are so successful because there is only little need for communication. But parallel algorithms with low communication complexity do not only exist for factoring and primality testing but for many other problems...
unknown title
"... n the mind of the average computer user, the problem of generating uniform variates by computer has been solved long ago. After all, every computer:system offers one or more function(s) to do so. Many software products, like compilers, spreadsheets, statistical or numerical packages, etc. also offe ..."
Abstract
 Add to MetaCart
n the mind of the average computer user, the problem of generating uniform variates by computer has been solved long ago. After all, every computer:system offers one or more function(s) to do so. Many software products, like compilers, spreadsheets, statistical or numerical packages, etc. also offer their own. These functions supposedly return numbers that could be used, for all practical purposes, as if they were the values taken by independent random variables, with a
Solving Equations Of Small Degree Modulo Large Primes
"... Introduction Atkin's algorithm [11] requires finding roots of polynomials modulo large primes (several hundreds decimal digits). However, the theory tells us that these polynomials split completely in the field Z=pZ we are interested in. The most straightforward approach is to use the probabi ..."
Abstract
 Add to MetaCart
(Show Context)
Introduction Atkin's algorithm [11] requires finding roots of polynomials modulo large primes (several hundreds decimal digits). However, the theory tells us that these polynomials split completely in the field Z=pZ we are interested in. The most straightforward approach is to use the probabilistic algorithm of Berlekamp (the "folk method" as described in [8]). In the general case, this method carries out a distinct degree factorization of a given polynom. The reader is referred to the recent work by Shoup [15] for the most recent progress in polynomial factorization. On the other hand, we have often to find roots of special polynomials. For instance, extracting qth roots (q prime) in Z=pZ has been studied in [14] for q = 2 and generalized in [18] for q odd. Extracting roots in more general fields is described in [1]. We can also wonder whether we