Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #60619
| Date | 2013-11-27 16:31 +0100 |
|---|---|
| From | Laszlo Nagy <gandalf@shopzeus.com> |
| Subject | Re: Cracking hashes with Python |
| References | <mailman.16458.1385423275.18129.python-list@python.org> <025c01ceea3a$47d07690$d77163b0$@org> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.3308.1385567259.18130.python-list@python.org> (permalink) |
On 2013-11-26 00:58, Marc wrote:
> Hashes, by definition, are not reversible mathematically. The only way to
> figure out what they represent is to take plaintext that might be the
> plaintext based on anything you might know about the original plaintext
> (which is often nothing) and hash it; then see if the hash matches the one
> you have. If it does, you have figured out the plaintext; if it doesn't try
> again. For a tool that does this, look at Rainbow tables.
There are also complete hash databases on the internet. They usually
reverse-map hash values to most common values found in dictionaries.
Here is an example:
>>> import hashlib
>>> h = hashlib.md5("test")
>>> h.hexdigest()
'098f6bcd4621d373cade4e832627b4f6'
>>>
Then you go here:
http://www.md5decrypter.co.uk/
There are many other databases like this, search for them with "md5
search" or "sha1 database" etc.
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
Re: Cracking hashes with Python Laszlo Nagy <gandalf@shopzeus.com> - 2013-11-27 16:31 +0100
csiph-web