(no subject)

[FREDRIK HULDTGREN]

>>> Paul Rubin <phr-n2002a at nightsong.com> 03/27/02 15:48 PM >>>
"FREDRIK HULDTGREN" <tdi01fhu at syd.kth.se> writes:
> I should have been more specific, yes I am talking about cryptology,
and
> sadly enough I am runnign win2k, the unix stuff goes out the window.
As
> for how large of numbers I am looking for, I'd say about 512bit
numbers
> should do it(perhaps larger, depens on how slow it becomes). Got any
> URLs that explain Fermat/Miller-Rabin tests?

By the way, use gmpy if you can.  It's about 10x faster than Python's
built-in arithmetic for long modexps.

Where can I get gmpy?
/fredrik