Here you can calculate online MD2 hashes for your strings.
Put your string into form below and press "Calculate MD2 hash".
As a result you will get MD2 hash of your string.
If you need another hash calculators, for example: HAVAL128-5, HAVAL192-5, SHA512-224 or SHA512-256 you can find it into appropriate section.
MD2 hash for 666666 string
76b5c599008ec90a384422e3172de406
Source string
666666
About MD2 hash algorithm
The MD2 Message-Digest Algorithm is a cryptographic hash function developed
by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers. MD2 is specified
in RFC 1319. Although MD2 is no longer considered secure, even as of 2014, it remains
in use in public key infrastructures as part of certificates generated with MD2 and RSA.
The "MD" in MD2 stands for "Message Digest".
Security problems
Rogier and Chauvaud (1997) described collisions of MD2's compression function, although
they were unable to extend the attack to the full MD2.
In 2004, MD2 was shown to be vulnerable to a preimage attack with time complexity equivalent
to 2104 applications of the compression function (Muller, 2004). The author concludes,
"MD2 can no longer be considered a secure one-way hash function".
In 2008, MD2 has further improvements on a preimage attack with time complexity of 273 compression
function evaluations and memory requirements of 273 message blocks.
In 2009, MD2 was shown to be vulnerable to a collision attack with time complexity of
263.3 compression function evaluations and memory requirements of 252 hash values. This is
slightly better than the birthday attack which is expected to take 265.5 compression function
evaluations.
In 2009, security updates were issued disabling MD2 in OpenSSL, GnuTLS, and Network Security Services.
You've visit right place if you want to calculate MD2 hashes.
Put string or even text into String to encode field above and press "Calculate MD2 hash".
You will get MD2 hash of your string in seconds.
You can also copy this hash right to your clipboard using the appropriate button.