Re: Can DLP be reduced to fatroing problem or vice versa?

"dan" <s9356047@xxxxxxxxxxxxxx> wrote in message
At the state of the art, can we reduce one of the two problems to the
other one?

iDLP is at least as complex as iFP. This has been proven many, many
different ways, probably the most accessible was a person a couple of years
back that thought he'd found a factoring method in P that actually reduced
iFP to iDLP in I believe linear time.