ARIBAS is an interactive interpreter for big integer arithmetic and multi-precision floating point arithmetic with a Pascal/Modula like syntax. It has several builtin functions for algorithmic number theory like gcd, Jacobi symbol, Rabin probabilistic prime test, factorization algorithms (Pollard rho, elliptic curve, continued fraction, quadratic sieve), etc.
ARIBAS is used for the examples of number theoretic algorithms in the book Algorithmische Zahlentheorie by O. Forster.
Recently added features (see also file CHANGES164.txt)
- Raised maximal floating point precision to 5120 bits
- Direct support for polynomial arithmetic in GF(2)[X]
- Direct support for arithmetic in the fields GF(2**n)
- Square roots modulo p
- Elliptic curve factorization
- Vector operations
There are versions of ARIBAS for
- UNIX workstations
- LINUX (80386-family)
- MacOS X
- MS Windows 95/98/XP or higher
For the versions running on Intel's 80X86 processors, some critical routines were written in Assembler, so ARIBAS runs especially fast under LINUX or Windows 95/98/XP/.. on a Pentium Computer.
To get the necessary software, go to the Download Page or directly to our
If you liked this article, subscribe to the feed by clicking the image below to keep informed about new contents of the blog: