On Thu, 22 May 2008 10:06:33 -0500, Bass, Walter W <[EMAIL PROTECTED]> wrote:
>I recall the password encryption algorithm for IDMS back in the late
>80's worked by repeatedly multiplying and then discarding the upper byte
>of the result. We actually duplicated this logic in COBOL so that we
>could hash user entered passwords and compare them to the stored values
>in the data dictionary. This algorithm was considered "irreversible"
>because there was no way of knowing the value of the bits that got
>discarded at each repetition and a single hash could not decrypt to one
>unique password.
>
If I wanted to crack this, I would start with:
http://en.wikipedia.org/wiki/Linear_congruence_theorem
-- gil
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
