"ds" <nospam@[EMAIL PROTECTED]
> writes:
> Oh, can it also be used in Visual Basic? On a Win 98 machine ?
Probably, with some work, since you get the source code... but not as
easily as yours, I think.
> Can it also find all 100% proven Prime Numbers?
> Can it also find RSA-factors ?...
Can yours? Amazing...
GNU MP has the Miller-Rabin probabilistic primality test and can
determine whether a number is definitely a composite, definitely a
prime, or probably a prime (with arbitrary high probability).
It also comes with an example program that demonstrates Pollard's
"rho" method for probabilistic factoring, which I don't know anything
about.
> Does it include encryption modules?
For that there is libgcrypt:
http://www.gnu.org/directory/security/libgcrypt.html
Since we are feature slinging: Does your library have optimized
assembly code for ARM, DEC Alpha 21064, 21164, and 21264, AMD 29000,
AMD K6, K6-2 and Athlon, Hitachi SuperH and SH-2, HPPA 1.0, 1.1 and
2.0, Intel Pentium, Pentium Pro/II/III, Pentium 4, generic x86, Intel
IA-64, i960, Motorola MC68000, MC68020, MC88100, and MC88110,
Motorola/IBM PowerPC 32 and 64, National NS32000, IBM POWER, MIPS
R3000, R4000, SPARCv7, SuperSPARC, generic SPARCv8, UltraSPARC, DEC
VAX, and Zilog Z8000? Does it even run on those? Does it run on
Unix, Linux, Solaris, AIX, HP UX? Does it do arbitrarily sized
floating point? Random numbers? Can I trust their quality? Can I
use it from Perl, Python, C++, Fortran, Java, Lisp, Scheme, Pascal?
And, can I get the source?
--
GPG: D5D4E405 - 2F9B BCCC 8527 692A 04E3 331E FAF8 226A D5D4 E405
|
