Science Central - All about Science

Friday, 5 September, 2008
Home  |  Submit Science Site  |  Add to Favorite  |  Contact

search
for
Directories
 
Category:  Science » Math » Number Theory » Prime Numbers UPDATE URL | REPORT BROKEN LINK

Elliptic Curve Primality Proving Algorithm

 Popularity:    Hit: 169 | Visit: 9
Details
The ECPP is a modern method of primality proving that does not require auxiliary factorizations. Instead, ECPP uses the sizes of groups of rational points on elliptic curves modulo n.

Sponsored Links:


URL:
Title:
Description:

Science Central - 490351 - The ECPP is a modern method of primality proving that does not require auxiliary factorizations.
Category:


Related sites
The Prime Page (An Index of Information on Prime Numbers) (Popularity: ): The prime source for information about prime numbers!
Prime Numbers and Factoring (Popularity: ): This page is a collection of links related to prime numbers and factoring of very ...
Prime k-tuplets (Popularity: ): Tony Forbes' extensive collection of special types of prime clusters.
The Prime Page (Popularity: ): Methods and definitions of finding prime numbers.
The Prime Puzzles & Problems Connection (Popularity: ): Carlos Rivera's collection of problems and puzzles related to prime numbers.
Aesthetics of the Prime Numbers Sequence (Popularity: ): Prime visualizations (both visual and auditory), applets, message board, links.
Proof of Bertrand's Postulate (Popularity: ): International Mathematics Olympiad tutorial proving the theorem of Chebyshef that there is a prime between ...
Dr. Nicely's Home Page (Popularity: ): Twin primes and Brun's number up to 10^14.
Prime Constellations (Popularity: ): Description of prime k-tuples, the first Hardy-Littlewood conjecture and the Hardy-Littlewood constants.
Primality Testing with Fermat's Little Theorem (Popularity: ): Test numbers for primality and pseudoprimality in Java.

© 2005-2008 Science Central. All Rights Reserved

Home | Submit Science Site | Add to Favorite | Privacy | Contact