ACM Home Page
Please provide us with feedback. Feedback
An improved Las Vegas primality test
Full text PdfPdf (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
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 17,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/74540.74545
What is a DOI?

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


Collaborative Colleagues:
E. Kaltofen: colleagues
T. Valente: colleagues
N. Yui: colleagues

Peer to Peer - Readers of this Article have also read: