Additional
Information: Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
Visible Euclidean Algorithm
Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm. http://www.math.umn.edu/~garrett/js/gcd.html
Implementations of Extended LLL
Links and notes by Wilberd van der Kallen. http://www.math.uu.nl/people/vdkallen/lllimplementations.html
The LLL Algorithm
Papers on the LLL algorithm and its applications collected by François Koeune. http://www.dice.ucl.ac.be/~fkoeune/LLL.html
CLINT
Hugh Montgomery's Computational Laboratories in Number Theory. TeX files and Pascal source code. ftp://ftp.math.lsa.umich.edu/pub/clint/
Computational Projects in Number Theory
Interesting problems, usually requiring extensive verifications or enumerations, to occupy the idle CPU time of workstations and personal computers. Compiled by Tomás Oliveira e Silva. http://www.ieeta.pt/~tos/hobbies.html
Computational Number Theory
Lecture notes by Robert Campbell, December 1997. http://www.math.umbc.edu/~campbell/NumbThy/Class/
Future Directions in Algorithmic Number Theory
Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM. http://aimath.org/WWN/primesinp/
LLL Page
Maintained by Keith Matthews. Papers, examples, pseudocode. http://www.numbertheory.org/lll.html
Some Number Records
Connected with divisibility and factoring. http://www.loria.fr/~zimmerma/records/
Basics of Computational Number Theory
Notes and Javascript illustrations by Robert Campbell. http://www.math.umbc.edu/~campbell/NumbThy/Class/BasicNumbThy.html