Re: Simple integer factorization algorithm

On Nov 29, 8:41 am, rossum <rossu...@xxxxxxxxxxxx> wrote:
On Fri, 28 Nov 2008 19:59:58 -0800 (PST), JSH <jst...@xxxxxxxxx>
wrote:

I'd like code to test the algorithm, please.

Since I have run some tests on James' algorithm in the past, here is
part of my test code.  This does the timing of the factoring algorithm
over a range of bit sizes to get an impression of how the algorithm
scales with the size of the target number.

The discussion is moving. Besides, it's useless to put up code that
is NOT for the algorithm that is current.

And the current algorithm is also simpler.

I've posted to comp.theory and am ready to move on.

Please no more replies in this thread.

Your newsgroup cops might get restless.


James Harris
.

Relevant Pages

  • Re: A factoring algorithm
    ... >> your algorithm is as fast as you say, ... > I have made comparison and smartcard are supposed to be 20 times slower ... The only people with a use for a factoring algorithm are ... It is highly unlikely that academics do not know about the algorithms used ...
    (sci.crypt)
  • Re: Triple-AES
    ... 3-DES, after all, was a response to the keyspace becoming ... If you're worried about the algorithm in particular being ... primary layer is just something i threw together and probably has no crypto ... to add the timing for the primary secondary and tertiary layer, ...
    (sci.crypt)
  • Re: Innovation, my TSP algorithm and factoring, timelines
    ... From what I've read on sci.math, it seems that your factoring algorithm as some subtle flaws, like the fact that is unable to a number like 6. ... pick the least cost path, ... Your surrogate factoring algorithm allows the surrogates to get arbitrarily big without anything to really convince me that it gets smaller. ...
    (comp.lang.java.programmer)
  • Re: A New Class of Unsafe Primes
    ... Unsafe Primes", http://eprint.iacr.org/2002/109, which proposes a fast way to ... This is a special case factoring algorithm that is no danger ... to randomly chosen RSA moduli. ... More attention has been given to Coppersmith's factoring algorithm, ...
    (sci.crypt)
  • Re: Finding the highest bit set in a 32-bit number
    ... This is worst case for my algorithm, ... timing, which can only be explained by the I/O bottleneck. ... C solutions that claimed 50 - 60 microseconds ...
    (comp.programming)