I have been thinking about this for a long time. I am building an E-Mail encryption program and was thinking about how Unix Encrypts its passwords.

If you encrypt a password so that it can never be Decrypted... only compared to another possible encrypted string, couldn't you have more than one password that would work.

For example:

mystring = "tron"
x = len(mystring) ' x = 4
or
x = round(squareroot(decimalval("t")))


You can use x as a variable that usually changes with most passwords... and you can get more complex with your variables to get the "Unix Effect". Then encrypted you end up with a nicely encrypted string. Then you prompt a user for a password. You encrypt it and compare. But by doing this wont you end up with multiple passwords that would work. I can create an example but it would take too long.

So Wuz Up? Does unix do something even more special that dissables this possiblity?