I wrote "math unlimited", download #
10044, mainly as a proof of concept. It is written in VFP, so it will be relatively slow, compared with something written in C++, for example.
Any size of digits are supported, up to the array limit in VFP (each digit uses one array element, in the internal calculations).
HTH,
Hilmar.
>I have a RSA signature S (128 byte integer )
>and modulus n (also 128 byte integer)
>
>I need to calculate
>
>( S**3 ) MOD n
>
>All I need is to perform exponent ( S**3 ) and MOD operation on
>128 byte integers.
>
>Is there any large integer class callable from FoxPro which can calculate this ?
>
>I looked also _cypt.vcx foundation class and into Windows Crypto API but
>havent found any function which does this.
>
>Any idea ?
Difference in opinions hath cost many millions of lives: for instance, whether flesh be bread, or bread be flesh; whether whistling be a vice or a virtue; whether it be better to kiss a post, or throw it into the fire... (from Gulliver's Travels)
