Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: Status of Recent User Information Leak (jdporter++)

by hobbs (Monk)
on Jul 31, 2009 at 09:54 UTC ( #784868=note: print w/replies, xml ) Need Help??


in reply to Re: Status of Recent User Information Leak (jdporter++)
in thread Status of Recent User Information Leak

When you hash 'em, hash 'em well. With a grain (or a hundred odd bits) of salt. And preferably with a suitably expensive KDF based on a hash that's not known to be totally hosed. glibc 2.7+ crypt() with the $5$ method should be reasonably strong; Crypt::SaltedHash with SHA-256 is less strong, but the best thing I can think of that's reasonably portable.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://784868]
help
Chatterbox?
[stevieb]: "Happy Monk Day, you've been here 8 troublesome years". Tack on another 8 before I signed up :)

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2017-08-19 15:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Who is your favorite scientist and why?



























    Results (311 votes). Check out past polls.

    Notices?