4) Crediting their bank account with two random amounts and ask them to enter those in. 5) Snail mail them some new password and ask them to enter it in. 6) Have them text or call some number and enter some value to a phone number with the mobile phone they registered on file. 7) … Read more
json.dumps() can sort dictionaries by key. So you don’t need other dependencies: import hashlib import json data = [‘only’, ‘lists’, [1,2,3], ‘dictionaries’, {‘a’:0,’b’:1}, ‘numbers’, 47, ‘strings’] data_md5 = hashlib.md5(json.dumps(data, sort_keys=True).encode(‘utf-8’)).hexdigest() print(data_md5) Prints: 87e83d90fc0d03f2c05631e2cd68ea02
Update Ironically, a few weeks after I posted the previous answer, two Chinese researchers, Tao Xie and Dengguo Feng, published a new single-block collision for MD5. I was unaware of that paper until now. A single MD5 block means that the input size is 64 bytes or 512 bits. Note that the inputs are mostly … Read more
I suggest you have a look to this SO page, CRC vs MD5/SHA1. Speed and collisions are discussed in this other thread. And as always Wikipedia is your friend. If I had to choose, there is an important question to answer: do you want that in any case there is no collision – or, at … Read more
Warning: Since this post was written in 2010, GPUs have been widely deployed to brute-force password hashes. Moderately-priced GPUs can run ten billion MD5s per second. This means that even a completely-random 8-character alphanumeric password (62 possible characters) can be brute forced in 6 hours. SHA-1 is only slightly slower, it’d take one day. Your … Read more
bin2hex(mcrypt_create_iv(22, MCRYPT_DEV_URANDOM)); mcrypt_create_iv will give you a random sequence of bytes. bin2hex will convert it to ASCII text Example output: d2c63a605ae27c13e43e26fe2c97a36c4556846dd3ef Bare in mind that “best” is a relative term. You have a tradeoff to make between security, uniqueness and speed. The above example is good for 99% of the cases, though if you are … Read more
You’re correct that it cannot guarantee uniqueness, however there are approximately 3.402823669209387e+38 different values in a 32 digit hex value (16^32). That means that, assuming the math behind the algorithm gives a good distribution, your odds are phenomenally small that there will be a duplicate. You do have to keep in mind that it IS … Read more
This code is from the CMupdater, from the CyanogenMod 10.2 android ROM. It tests the downloaded ROMs into the updater App. code: https://github.com/CyanogenMod/android_packages_apps_CMUpdater/blob/cm-10.2/src/com/cyanogenmod/updater/utils/MD5.java It works like a charm: /* * Copyright (C) 2012 The CyanogenMod Project * * * Licensed under the GNU GPLv2 license * * The text of the license can be found … Read more
As already stated, you cannot decrypt MD5 without attempting something like brute force hacking which is extremely resource intensive, not practical, and unethical. However you could use something like this to encrypt / decrypt passwords/etc safely: $input = “SmackFactory”; $encrypted = encryptIt( $input ); $decrypted = decryptIt( $encrypted ); echo $encrypted . ‘<br />’ . … Read more