Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!snorkelwacker!bloom-beacon!eru!luth!sunic!mcsun!hp4nl!dutrun!duteca!dutirt1!frank
From: frank@dutirt1.tudelft.nl (/2000)
Newsgroups: comp.sources.wanted
Subject: high precision arithmetic / prime numbers
Keywords: primes, high-precision
Message-ID: <722@duteca.UUCP>
Date: 9 Feb 90 15:12:31 GMT
Sender: news@duteca
Distribution: comp
Lines: 17

Hi there.

in order to implement a cryptosystem I need a generator which
generates large primes (magnitude 100 hex digits).

Before writing such a thing myself, I like to know whether
(part of ) it is publicly available, that is: sources.

More specific I am looking for C-routines which implement either

a) high precision multiply/divide/add/substract algorithms or

b) a complete, efficient, highly reliable prime generator (wow :-)	

I know most of the theory is in the "good old Knuth" but ...

Frank J de Bruin