MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Reverse Hash Function


Linda Pan wrote:
> 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 a reverse hash function: h'()
> 
> 
> 
> Then I can get a fade plain text A'= h'(B), probably A' is not equal to A, 
> but it doesn't matter!
> 
> 
> 
> I want to ask: Is it possible to build a reverse hash function h'() so that 
> h(h'(B)) is equal to B?
> 
> 
> 
> I do appreciate if you could answer me or send me a hint.
> 
> 
> 
> Merry Christmas!
> 
> 
> 
> P. L.
> 
> 
> 
Hi,

Think of the number of bits in your original text and in the resultant 
hash value. Normally a lot of information is lost in a hash function - 
so you can't reverse the process. Algorithms that use hash functions 
always make provision for the possibility that several things hash to 
the same number.

David Bailey
dbaileyconsultancy.co.uk


  • Prev by Date: Getting the file name in a package
  • Next by Date: Re: SymbolShape
  • Previous by thread: Reverse Hash Function
  • Next by thread: please solve