Primality and generation ofprime numbers.pptVIP

Primality and generation ofprime numbers Motivations Most of the public key encryption algorithms require large prime numbers. Example: in the RSA scheme, the modulo is the product of two prime numbers. In El-Gamal, LUC, ECC, etc … large prime numbers are also required. Prime and composite numbers A number is said to be prime if it is divisible only by 1 and by itself (1 is not a prime number). Otherwise it is said to be composite. Example: 7 is prime, 9 is composite. Euclid’s theorem: There is infinitely many prime numbers. Density LaVallée-Poussin theorem: the number of prime numbers smalle