[4898] in cryptography@c2.net mail archive
Re: MPI & Modular Arithmetic
daemon@ATHENA.MIT.EDU (Andreas Bogk)
Wed Jun 16 16:01:50 1999
To: Hans Viens <vieh01@gel.usherb.ca>
Cc: coderpunks@toad.com, cryptography@c2.net
From: Andreas Bogk <andreas@andreas.org>
Date: 16 Jun 1999 21:24:24 +0200
In-Reply-To: Hans Viens's message of "Mon, 14 Jun 1999 08:32:55 -0400"
Hans Viens <vieh01@gel.usherb.ca> writes:
> I would like to know if anyone of you know where I could find a free
> (commercial and non-commercial) implementation of a Multiprecision Integer
> and modular arithmetic ?
<shameless plug>
Gwydion Dylan (http://www.gwydiondylan.org) contains a bignum library
as part of the standard distribution. Using bignums in Dylan is as
easy as:
let expected-result = #e1558005952997140033806173725098810522409738596181909282129;
if(#e23 ^ #e42 == expected-result)
format-out("Bignums work!\n");
else
format-out("You lose!\n");
end if;
the #e being the syntax for specifying bignum constants (which are
known as <extended-integer> to Dylan).
<help request>
This library is still missing a couple of features such as modexp,
and could use some regression testing. Volounteers wanted.
</help request>
</shameless plug>
Andreas
--
Reality is two's complement. See:
ftp://ftp.netcom.com/pub/hb/hbaker/hakmem/hacks.html#item154
