[30190] in cryptography@c2.net mail archive
Factorization polynomially reducible to discrete log - known fact
daemon@ATHENA.MIT.EDU (Ondrej Mikle)
Sun Jul 9 16:10:27 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Sun, 09 Jul 2006 21:21:41 +0200
From: Ondrej Mikle <ondrej.mikle@gmail.com>
To: cryptography@metzdowd.com
Hello.
I believe I have the proof that factorization of N=p*q (p, q prime) is
polynomially reducible to discrete logarithm problem. Is it a known fact
or not? I searched for such proof, but only found that the two problems
are believed to be equivalent (i.e. no proof).
I still might have some error in the proof, so it needs to be checked by
someone yet. I'd like to know if it is already known (in that case there
would be no reason to bother with it).
Thanks
O. Mikle
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
