Recent developments in primality proving

Preda Mihăilescu

Mathematics and Computers in Simulation (MATCOM), 1999, vol. 49, issue 3, 193-204

Abstract: While proving compositeness of a natural number is a computational task that can be easily done in polynomial time, proving primality of an arbitrary positive integer is a harder task. Only two main streams of useful algorithms are known in this direction: elliptic curve primality provers (ECPPs, [F. Morain, Advances in Cryptology, EUROCRYPT '90, Lecture Notes in Computer Science, vol. 473, 1990, pp. 110–123]) and cyclotomy [W. Bosma, M. Der Hulst, Primality proving with cyclotomy, Ph.D. Thesis, 12278 University van Amsterdam, Holland, 1990; P.M. Mihăilescu, Cyclotomy of rings and primality testing, Ph.D. Thesis, Dissertation no., ETH Zürich, 1997].

Keywords: Primality proving; Cyclotomy; Geometry (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475499000518
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:49:y:1999:i:3:p:193-204

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().