Prev: Permutations and calculated strength in bits
Next: Associative hash function
From: Phil Carmody on 11 Apr 2010 07:15
Joseph Ashwood <ashwood(a)msn.com> writes:
> On Apr 9, 11:10 am, Pubkeybreaker <pubkeybrea...(a)aol.com> wrote:
>> On Apr 5, 3:10 pm, "Joseph Ashwood" <ashw...(a)msn.com> wrote:
>>
>> > "Pubkeybreaker" <pubkeybrea...(a)aol.com> wrote in message
>> > You can continue with your statements, your inability to extrapolate, your
>> > inability to understand the impact of your life's work, I will choose a
>> > different path.
>>
>> Your path is one of ignorance.
>>
>> I note that you still have not replied to my request for you to
>> show how a P-time oracle for IFP can be used for prime order group
>> DLP.  You
>> continue to assert that it can.
>>
>> What? No pithy comeback?
>
> We seem to be back to your insistence that I claimed the equivalence
> is mathematically proven. I have never claimed this. To quote my
> actual claims:
> DLP ... appears to be ... equivalent to IFP

What you say falls into one of two categories - meaningless or wrong.

As which of the two would you prefer us to treat it?

(I'm veering on the side of 'wrong' currently, as I interpret 'appears'
to imply existence of some evidence that can be reliably extrapolated.)

Phil
--
I find the easiest thing to do is to k/f myself and just troll away
-- David Melville on r.a.s.f1
 | 
Pages: 1
Prev: Permutations and calculated strength in bits
Next: Associative hash function