on 11/2/01 4:07 PM, jonnnathan wrote:

> or am i posting nonsense as usuals,

    Seems to me that its a speed vs. memory thing. If you need the speed,
table or array the numbers & look em up. If memory is a consideration,
compute em. Note, I can think of many other applications besides
cryptography. For example, in using really big numbers, it might be easier
to represent them as an array of multipliers of prime numbers such as
N(really big) = (x,y,z...) = 2^x+3^y+5^z+... Perhaps this could streamline
some applications?? For example: 40 = (3,0,1) & 60 = (2,1,1) 40*60 = 2400 =
(5,1,2) = (3,0,1) + (2,1,1) Don't really know if this is useful or not!

ronald b. kopelman
ronald.kopelman@...