Re: A89: Linux Port for 89/92

To: assembly-89@lists.ticalc.org
Subject: Re: A89: Linux Port for 89/92
From: "Josh Cunningham" <rogue_ant@hotmail.com>
Date: Thu, 15 Jul 1999 16:07:13 PDT
Delivered-To: assembly-89-outgoing@towerguard.unix.edu.sollentuna.se
Delivered-To: assembly-89@lists.ticalc.org
Reply-To: assembly-89@lists.ticalc.org

Ok, first I have a 400mhz computer that I would be willing to let it work of 
this for probebly 20 hrs a day.  And if others are willing to, then lets say 
we split the job by 100 computers.  The time it takes to factor big numbers 
would be significantly cut.  I tried to port this TI86/5 basic program to C, 
but am not very fluent in C...  I suggest all of you take a quick look at 
STL's Prime6.  This basic program is much faster then even the assembly 
ones.  Also, Prime6d can be splite upon multiple users.  Again, I tried to 
port it, but only with limited success.  It shouldn't be very hard as it is 
only about 30 lines of code.

Josh Cunningham

>From: Johan <johei804@student.liu.se>
>Reply-To: assembly-89@lists.ticalc.org
>To: assembly-89@lists.ticalc.org
>Subject: Re: A89: Linux Port for 89/92
>Date: Fri, 16 Jul 1999 00:54:19 +0200
>
>
>On Thu, Jul 15, 1999 at 17:14:30 -0500, Miles Raymond wrote:
> >
> > Well, if you know n, then finding p and q is easy, as they are the only
> > factors of n.  I know this because it is stated on the RSA site that 
>both p
> > and q are prime numbers, and a prime multiplied with another prime will 
>give
> > you a number that has only those two primes as factors.
>
>No, it's not easy at all. In fact this is the strength of RSA. It's *very*
>hard to factor large numbers, especially if they have only a few, large
>factors.
>
> > It wouldn't be a major waste of time if I found more than 3 factors 
>(meaning
> > that there was a typo) or if one of the factors was less than 2^128 as 
>you
> > say.
>
>Ok, go ahead and try it. But don't come to me after 20 years or so saying
>"damn! it was wrong! it had three factors!"...
>
> > Factoring this way might be slow, yes, but I do not have the math 
>knowledge
> > to use such algorithms that the RSA site suggests.  I do not know a 
>single
> > person who has spoken about doing anything near eliptic curves and such 
>that
> > are required for those high-level algorithms.
>
>Neither do I.
>
> > Math comes very easy to me, but I do not consider myself a 'math wiz'
> > either...
>
>Same as me then... :)  I guess many programmers find math easy since a
>similar kind of logic analyzing is involved in programming (right?).
>
>//Johan
>

_______________________________________________________________
Get Free Email and Do More On The Web. Visit http://www.msn.com