🚀 go-pugleaf

In article <4ft4f7$qdv@gap.cco.caltech.edu>, cilibrar@ugcs.caltech.edu
(Rudi Cilibrasi) wrote:

> I've just finished writing a constant-time factoring algorithm.
> (well, log-time, really, since it has to print out the answer, but
> that's just being picky)  When run, it prints out a non-trivial
> factor of the number to be factored.  (hardcoded at compile time
> for maximum efficiency)  Does this mean public-key cryptography
> is no longer secure, now that factoring is an easy problem? :)
> 
> I think this program says something about the C++ language. :)
> Comments welcome...

Cute.

Now if you did this in Ada or Common Lisp, you could take advantage of
'bignums'.  (Yes, Ada forces the _compiler_ to do all arithmetic in
arbitrary precision -- including arbitrary precision rational arithmetic.
One of the few things Ada got right, because it guarantees portability
of cross-compilers.)

-- 
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html