Example Code for the course

Algorithmic Number Theory, SS 2002

by Otto Forster
at the Department of Mathematics, LMU München

The code examples work with the multiprecision interpreter ARIBAS

File fibo.ari
Reccursive, iterative and fast algorithm to calculate the Fibonacci numbers
 
File gcd.ari
Code for the Euclidean algorithm
 
File chin.ari
Code for the chinese remainder theorem
 
File primroot.ari
Function to calculate primitive roots
 
File p1factor.ari
Pollard's (p-1)-factorization algorithm
 
File factor0.ari
Factorization using trial division, Pollard's rho-method and quadratic sieve
 
File jacobi.ari
Calculation of the Jacobi symbol
 
File probtest.ari
Solovay-Strassen and Miller-Rabin primality tests
 
File ellfact.ari
Elliptic curve factorization
 

Homepage of the course
Otto Forster 2002-04-16