<--- Back to Details
First PageDocument Content
Mathematics / Primality tests / Number theory / Cryptography / Integer sequences / Prime number / Primality certificate / Integer factorization / Fermat number / Mersenne prime / Pseudoprime / Randomized algorithm
Date: 2003-03-04 03:28:40
Mathematics
Primality tests
Number theory
Cryptography
Integer sequences
Prime number
Primality certificate
Integer factorization
Fermat number
Mersenne prime
Pseudoprime
Randomized algorithm

LNCSFaster Primality Testing

Add to Reading List

Source URL: www.math.ru.nl

Download Document from Source Website

File Size: 331,82 KB

Share Document on Facebook

Similar Documents

Primality Testing Using Elliptic Curves SHAFI GOLDWASSER Massachusetts Institute of Technology, Cambridge, Massachusetts AND JOE KILIAN

Primality Testing Using Elliptic Curves SHAFI GOLDWASSER Massachusetts Institute of Technology, Cambridge, Massachusetts AND JOE KILIAN

DocID: 1ovd7 - View Document

LNCSFaster Primality Testing

LNCSFaster Primality Testing

DocID: 1lq38 - View Document

IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs

IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs

DocID: 1kNR2 - View Document

math 420  FINAL EXAM Monday December 13, 1993

math 420 FINAL EXAM Monday December 13, 1993

DocID: 185bj - View Document

Optimization of Primality Testing Methods by GPU Evolutionary Search Steve Worley∗ Worley Laboratories Abstract Modern fast primality testing uses a combination of Strong Probable Prime (SPRP) rejection tests. We find

Optimization of Primality Testing Methods by GPU Evolutionary Search Steve Worley∗ Worley Laboratories Abstract Modern fast primality testing uses a combination of Strong Probable Prime (SPRP) rejection tests. We find

DocID: 15rmy - View Document