Inverse Hash Function

From: Linda Pan (panlinda_at_hotmail.com)
Date: 12/30/04 

Date: Thu, 30 Dec 2004 01:39:26 GMT

Dear experts,

I met a problem, and I don't have experience to solve it. Thus, please give
me a help.

My question is:

I have a hash function: h().
I have a plain text: A
So I can get a hash value B = h(A)

Suppose that I have an inverse hash function: h'(), so that I can get a fake
plain text A', where A' = h'(B), probably A' is not equal to A, but I don't
care the original A.

I want to ask: Is it possible to build an inverse hash function h'() so that
h(h'(B)) = B?

I do appreciate if you could answer me or send me a hint.

Happy New Year!

P. L.

Relevant Pages

  • Re: Inverse Hash Function
    ... > I have a hash function: ... > fake plain text A', where A' = h', probably A' is not equal to A, but I ... Is it possible to build an inverse hash function h'so ... > I do appreciate if you could answer me or send me a hint. ...
    (sci.crypt)
  • Re: Inverse Hash Function
    ... > Suppose that I have an inverse hash function: h', so that I can get a fake ... > plain text A', where A' = h', probably A' is not equal to A, but I don't ...
    (sci.crypt)
  • Re: Inverse Hash Function
    ... > I have a hash function: ... Is it possible to build an inverse hash function h'so ... If you are only interested in collision resistant, but not one way hash - ... is totally insecure because knowledge of decryption exponent allows ...
    (sci.crypt)
  • Re: Union of sets in O(N)
    ... from the above that a hash function without hash collision exist? ... This sounds like homework to me. ... I'll give you a hint: ...
    (comp.theory)