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

*From*: "Joseph Ashwood" <ashwood@xxxxxxx>*Date*: Fri, 21 Apr 2006 09:21:48 GMT

"dan" <s9356047@xxxxxxxxxxxxxx> wrote in message

news:1145600768.857806.264350@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

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.

Joe

.

**Follow-Ups**:**Re: Can DLP be reduced to fatroing problem or vice versa?***From:*Pubkeybreaker

**References**:

- Prev by Date:
**Re: EC-IES, authentication and plausible deniability** - Next by Date:
**Re: Complex Theoretical One Way Hash Question** - Previous by thread:
**Re: Can DLP be reduced to fatroing problem or vice versa?** - Next by thread:
**Re: Can DLP be reduced to fatroing problem or vice versa?** - Index(es):