Whoops...looks like I've started a new thread here. ;-)
Hashing:
What's green and red and goes a hundred miles an hour? You guessed it, a
frog in a blender. When you "hash" a password, that's essentially what
you're doing - putting it in a blender and making something completely
different that
>Whoops...looks like I've started a new thread here. ;-)
>
>Hashing:
>
>What's green and red and goes a hundred miles an hour? You guessed it, a
>frog in a blender. When you "hash" a password, that's essentially what
>you're doing - putting it in a blender and making something completely
>differ
I'd just wanted to tag-on to the hash can't be undone statement. It's not
always apparent why a hash can't be undone. I know a few people that would
say the doctor on Star Trek would have no problem putting the frog back
together. To them it's still in the realm of possible, no matter how hard
This is very interesting. Would you please talk more on the section below. There are
infinite numbers between 1 and 2 and 2 and 3. But how does that guarantee uniqueness
of passwords?
"So how does a hash guarantee that many A values
don't result in the same B result? I'll let you figure that
On Sat, 24 Feb 2001, Bradley J. Wilson wrote:
> Whoops...looks like I've started a new thread here. ;-)
>
> Hashing:
>
> What's green and red and goes a hundred miles an hour? You guessed it, a
> frog in a blender. When you "hash" a password, that's essentially what
> you're doing - putting it
5 matches
Mail list logo
