| An improved Las Vegas primality test |
| Full text |
Pdf
(597 KB)
|
| Source
|
International Conference on Symbolic and Algebraic Computation
archive
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
table of contents
Portland, Oregon, United States
Pages: 26 - 33
Year of Publication: 1989
ISBN:0-89791-325-6
|
|
Authors
|
|
E. Kaltofen
|
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York
|
|
T. Valente
|
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York
|
|
N. Yui
|
Department of Mathematics, Queen's University, Kingston, Ontario, Canada K7L3N6
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 2
|
|
|
ABSTRACT
We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctness which may be verified in polynomial time. Atkin's method computes the order of an elliptic curve whose endomorphism ring is isomorphic to the ring of integers of a given imaginary quadratic field Q(√—D). Once an appropriate order is found, the parameters of the curve are computed as a function of a root modulo n of the Hilbert class equation for the Hilbert class field of Q(√—D). The modification we propose determines instead a root of the Watson class equation for Q(√—D) and applies a transformation to get a root of the corresponding Hilbert equation. This is a substantial improvement, in that the Watson equations have much smaller coefficients than do the Hilbert equations.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
D.Husem611er, Elliptic Curves, Springer GTM 111, 1987
|
| |
3
|
|
| |
4
|
E.Kaltofen and N.Yui, "Explicit construction of the Hilbert class fields of imaginary quadratic fields by integer lattice reduction", New York Number Theory, Lec. Notes Malh.,Springer Verlag, to appear, 1989
|
| |
5
|
A.K.Lenstra and H.W.Lenstra jr., "Algorithms in Number Theory", in Handbook of Theoretical Science, North Holland, Amsterdam 1987
|
| |
6
|
H.W.Lenstra Jr., "Factoring integers with elliptic curves", Annals of Math, 126, 1987, pp.649-673
|
| |
7
|
F.Morain, "Implementation of the Gotdwasser-Kilian- Atkin Primality Testing Algorithm", (Draft), University of Limoges, 1988
|
| |
8
|
J.H.Silverman, The Arithmetic of Elliptic Curves, Springer GTM 106, 1986
|
| |
9
|
G.N.Watson, "Singular Moduli (4)', Acta Arithmetica i (1035), p p.284-323
|
CITED BY 2
|
A. Diaz , E. Kaltofen , K. Schmitz , T. Valente, DSC: a system for distributed symbolic computation, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.323-332, July 15-17, 1991, Bonn, West Germany
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|