Large Integer Overflow - Causing a Bottleneck - Any solution.

[Austin Obyrne <austin.obyrne@hotmail.com>]

I am using a very old Ada compiler (gnat 311.p) in the Windows_7 operating system that has 64-bit architecture to write cryptography.

Everything has gone well thus far but now I find I am being stymied from expanding my cipher by the upper bound placed by my Ada compiler on positive integers to 2^31 -1 or 2147483647 for positive integers.

Is there any solution to this that won't want me to leave the main program in order to do it.

Your usual help would be greatly appreciated.

adacrypt