Beefy Boxes and Bandwidth Generously Provided by pair Networks httptech
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Digest::MD5 variation problem?

by AlexTape (Monk)
on Aug 23, 2013 at 12:04 UTC ( #1050656=note: print w/ replies, xml ) Need Help??


in reply to Re: Digest::MD5 variation problem?
in thread Digest::MD5 variation problem?

use Digest::MD5 qw(md5 md5_hex md5_base64); print "[" . md5_base64( md5_hex( md5( "[" . 'test' ) ) ) . "]\n"; print "[" . md5_base64( "[" . 'test' ) . "]\n";
will output
[3Pa22aZpZCVQ+ZE1bfCMdQ] [llqG4cA/pfE1Ii5TekVThQ]
ignorance is no excuse - but a trigger for questions ;) as you said: yes, it should suffice :D:D:D
i tried to make it really well md5īd ;)
kindly
$perlig =~ s/pec/cep/g if 'errors expected';


Comment on Re^2: Digest::MD5 variation problem?
Select or Download Code
Re^3: Digest::MD5 variation problem?
by zork42 (Monk) on Aug 24, 2013 at 03:49 UTC
    i tried to make it really well md5īd ;)
    1. I think 1 application of MD5 would do the job as I don't think MD5 hashes can be reversed at present. ie MD5 has not been cracked yet apart from "collision" attacks.
      However there are much more secure hashes like SHA-2.
      See http://en.wikipedia.org/wiki/MD5#Security, and http://en.wikipedia.org/wiki/SHA-2

    2. There are reasons why you might want to do a very large number of repeated invocations of a hash function. This is called Key stretching (see "(A)" below)
      However, "very large" is a lot more than 3 ;). Maybe 1,000s or much, much more.
      eg maybe see how many invocations you can do in 0.1 sec or 1 sec on the target system, and use that number of hash invocations.
      Adjust bcrypt cost to prevent future password hash attacks proposes a method which will keep password hashes strong, even as CPU speeds increase.

    3. Also, you should ideally use a large salt that is different for each user. (see "(B)" below)

    From http://en.wikipedia.org/wiki/Cryptographic_hash_function#Password_verification:
    Password verification

    A related application is password verification. Storing all user passwords as cleartext can result in a massive security breach if the password file is compromised. One way to reduce this danger is to only store the hash digest of each password. To authenticate a user, the password presented by the user is hashed and compared with the stored hash. (Note that this approach prevents the original passwords from being retrieved if forgotten or lost, and they have to be replaced with new ones.) The password is often concatenated with a random, non-secret salt value before the hash function is applied. The salt is stored with the password hash. (B) Because users have different salts, it is not feasible to store tables of precomputed hash values for common passwords. (A) Key stretching functions, such as PBKDF2, Bcrypt or Scrypt, typically use repeated invocations of a cryptographic hash to increase the time required to perform brute force attacks on stored password digests.

    Main article: http://en.wikipedia.org/wiki/Password_cracking

    I hope this is of interest! :)
      nice! thanks!
      $perlig =~ s/pec/cep/g if 'errors expected';
Re^3: Digest::MD5 variation problem?
by afoken (Parson) on Aug 24, 2013 at 08:37 UTC
    print "[" . md5_base64( md5_hex( md5( "[" . 'test' ) ) ) . "]\n";

    i tried to make it really well md5īd ;)

    Sorry, but this is just plain stupid. The innermost md5 reduces (or expands) all input to 128 bit. md5_hex around this very likely reduces its input to less than 128 bits (I would be really surprised if all 2^128 possible 128 bit arguments for the MD5 function would result in 2^128 different results). Representing the result in hex adds adds 128 constant bits, so at least half of the input for md5_base64 is constant. Ideally, this would reduce the output of md5_base64 to 2^64 possible values, but due to the previous hash functions, it is likely that the there are far less different values, so the probability for collisions rises. Or shorter: different passwords can result in the same hash value.

    zork42++ told you how to properly handle passwords, mainly salting and using strong hash functions. MD5 was strong decades ago, now it should be considered weak.

    zork42 also told you about key stretching. Implemented properly, it improves the encryption quality. Read the Wikipeda article. Or just look at the code examples in that article: The key stretching does not add constant bits, but varying bits from the input.

    Alexander

    --
    Today I will gladly share my knowledge and experience, for there are no sweeter words than "I told you so". ;-)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1050656]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (10)
As of 2014-04-19 01:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (475 votes), past polls