[19056] in bugtraq
Re: Pinoy math enthusiast finds fast way to decode RSA encryption
daemon@ATHENA.MIT.EDU (Taneli Huuskonen)
Wed Feb 7 12:44:39 2001
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Message-ID: <200102070906.f1796OA03093@sirppi.helsinki.fi>
Date: Wed, 7 Feb 2001 11:06:24 +0200
Reply-To: Taneli Huuskonen <huuskone@CC.HELSINKI.FI>
From: Taneli Huuskonen <huuskone@CC.HELSINKI.FI>
X-To: "Lacroix, Robert" <ralacroix@HYDRO.MB.CA>
To: BUGTRAQ@SECURITYFOCUS.COM
In-Reply-To: <9BC8CAC649FCD211ABE90008C7089570064C94B6@mail02.hydro.mb.ca>
from "Lacroix, Robert" at "Feb 6, 2001 04:42:48 pm"
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
"Lacroix, Robert" <ralacroix@HYDRO.MB.CA> 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/
