ARIBAS Code
zur Vorlesung
Algorithmische Zahlentheorie und Public Key Kryptographie,
SS 2009
Algorithmische Zahlentheorie II, WS 2009/10
von Otto Forster
Mathematischen Institut der LMU München
The code examples work with the multiprecision interpreter
ARIBAS
-
fibo.ari
- Algorithms to calculate the Fibonacci numbers
-
gcd.ari
- Code for the Euclidean algorithm
-
chin.ari
- Code for the chinese remainder theorem
-
factor.ari
- Factorization routines
-
primroot.ari
- Function to calculate primitive roots
-
quadres.ari
- Jacobi symbol and function to calculate square roots mod p
-
primetest.ari
- Primality tests
-
qsfact.ari
- Quadratic sieve factorization
-
AES.ari
- AES block cipher
-
SHA1.ari
- SHA-1 message digest
-
pollrho.ari
- Pollard's rho factorization algorithm
-
dlog.ari
- Discrete logarithm using Pohlig-Hellman and rho method
-
AKS.ari
- Algorithms for the AKS primality test
-
ecprimetest.ari
- Atkin/Morain elliptic curve primality test
Homepage of the course
Homepage of the course, part II
Otto Forster 2009-04-23/2009-10-11