06-21-2005 09:43 AM
06-21-2005 09:57 AM
06-21-2005 10:10 AM
06-21-2005 11:37 AM
06-21-2005 11:41 AM
06-21-2005 11:44 AM
06-21-2005 11:56 AM
07-08-2005 01:06 PM - edited 07-08-2005 01:06 PM
Message Edited by AmanoGinji on 07-08-2005 01:07 PM
07-08-2005 10:11 PM
To expand on the idea altenbach gave, attached is a copy of a VI I wrote to implement the SHA1 (Secure Hash Algorithm 1). It is used extensively and provides a way of storing things without storing things--if you get my point. When the user creates the password (of any length!) you store away the SHA1 hash of the value (40 characters). To log in the operator enters their password and you again run the SHA1 algorithm against it and if the two hashes match they are in.
According to the RFC defining the algorithm, given a hash, it is "computationally unfeasible" to try and generate another string that produces the same hash.
Mike...
07-11-2005 05:43 AM
I few years ago they said that about MD5 as well :
@mikeporter wrote:
According to the RFC defining the algorithm, given a hash, it is "computationally unfeasible" to try and generate another string that produces the same hash.
Mike...