Faraoun Kamel Mohamed

Send e-mail to this Author

  • Save 70% with TMS ALL-ACCESS
  • Access to new products upon release
  • Access to premium support & updates for 1 year
  • Access to previews and betas
  • Perpetual licenses to all products
Author Products

Total 1 product

Fastest Huge Integer Computation v.1.0

Code Samples > Samples > Science

By Faraoun Kamel Mohamed.

Freeware 11 May 2012


A library of functions for Delphi, to manipulate very big integers including very fast addition, substraction, multiplication and division as bisc functions. The following modular arithmetic functions are implemented:
  • Modular inversion with respect to any module;
  • Integer power, modular exponentiation, Montgomery exponentiation;
  • Logical integer manipulation :and,or xor, not, .GCD computation;
  • Extended Euclid Algorithm;
  • Diophantienne equation resolution;
  • Linear congruence equation resolution. Quadratic congruence resolution. Very fast Prime numbers generation;
  • Strong primes generation;
  • Safe primes with generator generation;
  • Very fast primality testing;
  • Conversion functions int to/from string, hex,binary and octal
  • and much more...


  • Status: Fully functional
  • Source: On request
  • Size: 411kB

Platforms: D6