Find large prime numbers

Announcements:

Group 13's first meeting will be on Wednesday, April 15, 12:15--14:00, in U49D.

Description

Original project description.

Some books with information on primality testing (easiest to read first):

  1. Introduction to Algorithms, 2nd edition, by Cormen, Leiserson, Rivest, and Stein.
  2. Cryptography: Theory and Practice, 2nd edition, by Stinson.
  3. Algorithmic Number Theory, Volume 1, by Bach and Shallit.
  4. Prime Numbers and Computer Methods for Factorization, by Riesel.

Notes

An older Discrete Math course had notes (pages 3 to 12 are the most relevant - Extended Euclidean Algorithm and algebra) and slides on elementary number theory, probability, equivalence relations and algebra (pages 32-47, 58-64, 78-86, 97-102, 145-147, 158-159, 182-194 are most relevant - the last group is the slides on algebra).

Miscellaneous

Andrew Swann's links and metalinks to relevant to students writing mathematical projects.
The Collection of Computer Science Bibliographies can be useful for searches on computer science topics.
Bruce Schneier's predictions regarding factoring.
Some notes on computational number theory (notes.dvi) (also in PDF).
A note on Pollard's factoring algorithm (Pollard.dvi). This also contains a description of the birthday paradox.
Cryptology pages on the Web.
Information about large integer packages.
Information from NIST about the Advanced Encryption Standard (Rijndael), including the "Algorithm Specification".

   
IMADA HOME | SDU HOME | Previous page |
Last modified: Thu Apr 16 09:12:02 CEST 2009 - Joan Boyar <joan@imada.sdu.dk> 		   

 

   Data protection at SDU ▪ Databeskyttelse på SDU