Additional
Information: Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality. This page was last updated on June 23rd, 2008
LLL Page
Maintained by Keith Matthews. Papers, examples, pseudocode. http://www.numbertheory.org/lll.html
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
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
Some Number Records
Connected with divisibility and factoring. http://www.loria.fr/~zimmerma/records/
Implementations of Extended LLL
Links and notes by Wilberd van der Kallen. http://www.math.uu.nl/people/vdkallen/lllimplementations.html
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/
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
Basics of Computational Number Theory
Notes and Javascript illustrations by Robert Campbell. http://www.math.umbc.edu/~campbell/NumbThy/Class/BasicNumbThy.html