Jump to content

Welcome to Geeks to Go - Register now for FREE

Geeks To Go is a helpful hub, where thousands of volunteer geeks quickly serve friendly answers and support. Check out the forums and get free advice from the experts. Register now to gain access to all of our features, it's FREE and only takes one minute. Once registered and logged in, you will be able to create topics, post replies to existing threads, give reputation to your fellow members, get your own private messenger, post status updates, manage your profile and so much more.

Create Account How it Works
Photo

Just a little thought about Encryption


  • Please log in to reply

#1
danny3793

danny3793

    Member

  • Member
  • PipPip
  • 12 posts
Does anyone know how exactly MD5 hashing is done? Reason im wanting to know is because im wanting to code my own Hashing process for my site. As, MD5 is crackable easily by just checking a hashed word against your MD5 hash youve found. Id like to make my own hash to increase security.
  • 0

Advertisements


#2
skate_punk_21

skate_punk_21

    Malware Removal Expert

  • Retired Staff
  • 1,049 posts
any particular language?
  • 0

#3
Swandog46

Swandog46

    Malware Expert

  • Member
  • PipPipPipPip
  • 1,026 posts
  • MVP
The algorithm is independent of the language of implementation.

danny3793, did you bother to look yourself? Google 'MD5' and Wikipedia's article, the first hit, explains it well.
http://en.wikipedia.org/wiki/MD5

MD5 is crackable easily by just checking a hashed word against your MD5 hash youve found.

This is not "cracking" MD5 -- this is "verifying" a hash, and if this were not possible hashes would be useless. The point of a hash is to generate a unique string that can easily be checked, but cannot be *inverted*. So if you know that some string S hashes to some hash value H under some hash function f, you can easily check that f(S)=H just by computing f(S) by brute force. But if you are just given the hash H, it is not easy to "invert" the function f, to get S. This is the nature of a hash function --- easy to go in one direction (given S, find H), hard to go in the other direction (given H, find S). If you can find S from H, *THIS* is called cracking or breaking the hash function.
  • 0






Similar Topics

0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users

As Featured On:

Microsoft Yahoo BBC MSN PC Magazine Washington Post HP