<--- Back to Details
First PageDocument Content
Number theory / Finite fields / Primality tests / Integer sequences / Quadratic sieve / Lenstra elliptic curve factorization / Prime numbers / General number field sieve / Miller–Rabin primality test / Integer factorization algorithms / Abstract algebra / Mathematics
Date: 2010-12-10 09:14:54
Number theory
Finite fields
Primality tests
Integer sequences
Quadratic sieve
Lenstra elliptic curve factorization
Prime numbers
General number field sieve
Miller–Rabin primality test
Integer factorization algorithms
Abstract algebra
Mathematics

Add to Reading List

Source URL: fs.gallup.unm.edu

Download Document from Source Website

File Size: 5,03 MB

Share Document on Facebook

Similar Documents

Fast Generation of Prime Numbers on Portable Devices An Update Marc Joye Thomson Security Labs

DocID: 1tNf1 - View Document

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

DocID: 1tqCJ - View Document

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and explain how it is connected with the prime numbers. The second is

DocID: 1tgjQ - View Document

´ AND THE DISTRIBUTION HARALD CRAMER OF PRIME NUMBERS∗ ANDREW GRANVILLE† IN ATHENS, GEORGIA, U.S.A. “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ mea

DocID: 1tblA - View Document

The Discrete Logarithm Problem Ren´e Schoof Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ)∗ is at present a very difficult problem. The security of

DocID: 1sCRX - View Document