Xref: utzoo sci.crypt:3283 sci.math:11950 sci.math.symbolic:1602 comp.sources.wanted:12797 alt.sources.wanted:444
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!sun-barr!newstop!sunaus.oz!softway!otc!edmund
From: edmund@otc.otca.oz (Edmund Ting)
Newsgroups: sci.crypt,sci.math,sci.math.symbolic,comp.sources.wanted,alt.sources.wanted
Subject: RSA software
Keywords: prime numbers, factorisation
Message-ID: <1844@otc.otca.oz>
Date: 8 Aug 90 06:57:39 GMT
Lines: 27


       I would like to know if there are any public domain software packages
in either executable or source code which do either of the following

       - perform arbitrary precision arithmetic.
       - factorise large numbers.
       - test for primality.

I know that the first of these was asked for before in sci.crypt, but I have
lost that particular list. I am particularly (but not exclusively) interested
in packages which run on IBM compatibles. If they are source code, please
say what language they are written in.

-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-

	  Edmund Ting
	  Services Enhancement R&D
	  |||| OTC ||

  ACSnet:  edmund@otc.otca.oz
    UUCP:  {uunet,mcvax}!otc.oz!edmund
   Phone:  (02) 287 4301
     Fax:  (02) 287 4990
   Snail:  OTC Development Unit,
	   GPO Box 7000, Sydney 2001, Australia

-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-+-= =-