Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!princeton!allegra!ulysses!gatech!linus!bs
From: bs@linus.UUCP (Robert D. Silverman)
Newsgroups: comp.lang.c,comp.unix.questions,sci.math
Subject: Re: Wanted: arbitrary precision integer arithmetic
Message-ID: <141@linus.UUCP>
Date: Fri, 5-Dec-86 13:18:53 EST
Article-I.D.: linus.141
Posted: Fri Dec  5 13:18:53 1986
Date-Received: Tue, 9-Dec-86 04:00:45 EST
References: <4056@jhunix.UUCP> <556@maynard.UUCP> <266@umnd-cs.UUCP>
Distribution: na
Organization: The MITRE Corp., Bedford, MA
Lines: 11
Summary: I have routines at least 10 times faster
Xref: mnetor comp.lang.c:312 comp.unix.questions:291 sci.math:293



I have a set of routines that beat the UNIX routines by over an order
of magnitude. These include not only +,-,*,/, but also things like
GCD's modular inverses, Jacobi symbol, modular exponentiation, etc. etc.
They are public domain and I use them in my factoring and prime testing
work. They run on SUN-3's and VAXEN and are 99% portable. They do use,
however 3 routines ~5 lines each to get at the ediv and emul instructions
and are written in assembler.

Bob Silverman