2007-11-04 02:18:48 UTC
I would like to know if make sense the statement "Reversible hashing".
I mean is possible to develop a hash algorithm, or better a digest
algorithm, (variable input lenght, fixed output lenght) that do not
respect the rule to be one-way. I don't want to compare with other
hash algo such SHAx, MDx ecc... but, it can be done?
Just for curiosity; I think this question can be some kind of
interesting discussion, I am wrong?
Oh, sorry for my bad english ;-).