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.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
- Baxa, C.: Book review of: O. Forster, Algorithmische Zahlentheorie. 2nd ed. (2018)
- Elsner, Carsten; Spilker, Jürgen: The Lucas property for linear recurrences of second order (2018)
- Knapp, Wolfgang: On Korselt’s criterion for Carmichael numbers (2013)
- Rubin, Ingmar; Schuh, Hans-Jürgen: On collecting complete series of figures (2013) MathEduc
- Welschenbach, Michael: Cryptography in C and C++ (2013)
- Deiser, Oliver: Fundamental concepts in scientific mathematics. Language, numbers and first explorations. (2010)
- Elsenhans, Andreas-Stephan; Jahnel, Jörg: The asymptotics of points of bounded height on diagonal cubic and quartic threefolds (2006)
- Elsenhans, Andreas-Stephan; Jahnel, Jörg: The Diophantine equation ( x^4 + 2 y^4 = z^4 + 4 w^4) (2006)
- Grübel, Rudolf; Reimers, Anke: On the number of iterations required by von Neumann addition (2001)
- Forster, Otto: Algorithmic number theory (1996)