From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 28 Jul 93 20:46:43 GMT
From: agate!spool.mu.edu!uwm.edu!wupost!waikato.ac.nz!canterbury.ac.nz!news!ota
go.ac.nz!is20115@ucbvax.Berkeley.EDU
Subject: Re: ADA arithmetic
Message-ID: <1993Jul29.094643.1@otago.ac.nz>
List-Id: <comp.lang.ada>

In article <1993Jul28.170334.1@otago.ac.nz>, simon@otago.ac.nz (The Arch-Devian
t) writes:
> In article <gmacmanus.2.743824190@gandalf.otago.ac.nz>, gmacmanus@gandalf.ota
go.ac.nz (Greg MacManus) writes:
>> How do you implement the numbers then?
>> 
>> 	- Just curious.
> 
> Easy - treat them as variable-length arrays (ie in a record with a default
> discriminant) of 0..9 then treat each term as a coefficient in an polynomial
> evaluated at x=10. As Paul observes, the literature is bulging with nifty
> ways for performing operations on polynomials, and since we don't have to
> generate keys we can get away with defining only three operations - square
> the number, halve it and test for a remainder, and MOD.
> 
Well of course....  now I know why I can't do it....    I don't speak the lingo
I still recon my idea of FTP'ing a package is the best idea.  Is that legal
the fact that we didn't write the arithmetic package shouldn't matter should
it????????
	////
  \\\\ ////   ******   Long live the Amiga!!!    *******  
    \\////    

Paul?  I mean the idea of the assignment is to implement an RSA key thingie so