Fastest Huge Integer Computation 1.0

In category

Code Samples > Samples > Science

Description

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...

Informations

• Status: Fully functional
• Source: FW
• Size: 421 137kB

Platforms:

• Delphi 6

Downloads

• Delphi 6