-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

"Lacroix, Robert" <[EMAIL PROTECTED]> writes:

> # This algorithm efficiently solves problems of the form 2^x = aN + 1,
> # using O(log N) storage and O(log N)(log N) time.

Sorry to be a wet blanket, but it should be "O(N) time".  As a factoring
method, this is less efficient than trial division.

Taneli Huuskonen

-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 5.0i for non-commercial use
Charset: noconv

iQA/AwUBOoEP9V+t0CYLfLaVEQLX3gCfcHHps/Rh8gI+4si0GI1qGbTH8FsAoMkx
+4Z1jLiJt+cgnwHqvS/b2XeB
=Zant
-----END PGP SIGNATURE-----
--
I don't   | All messages will be PGP signed,  | Fight for your right to
speak for | encrypted mail preferred.  Keys:  | use sealed envelopes.
the Uni.  | http://www.helsinki.fi/~huuskone/ | http://www.gilc.org/

Reply via email to