Factorization polynomially reducible to discrete log - known fact or not?

[Ondrej Mikle]

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 [EMAIL PROTECTED]