Follow us on Twitter!
The important thing is not to stop questioning. - Albert Einstein
Friday, April 25, 2014
Navigation
Home
HellBoundHackers Main:
HellBoundHackers Find:
HellBoundHackers Information:
Learn
Communicate
Submit
Shop
Challenges
HellBoundHackers Exploit:
HellBoundHackers Programming:
HellBoundHackers Think:
HellBoundHackers Track:
HellBoundHackers Patch:
HellBoundHackers Other:
HellBoundHackers Need Help?
Other
Members Online
Total Online: 19
Guests Online: 17
Members Online: 2

Registered Members: 82906
Newest Member: ilija
Latest Articles
View Thread

HellBound Hackers | Computer General | Cryptography

Author

n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 01-04-08 18:48
Total n00b question, don't beat me up.

So I would like to decrypt an sha1 password(yeah I know I need a supercomputer and many years)...anyway that aside, I know the salt to the hash I am trying to break and I was wondering if there was a way to build a rainbow table with the salt built in. Also if there is some other way to decrypt SHA1 that I am missing? All the forum posts I read pretty much had people just saying it wasn't possible. On wikipedia it mentions a birthday attack algorithm that may work. Anybody know anything?


Author

RE: n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 01-04-08 19:14
yes man..i've heard of that kind of decryption. I myself have assembled a little program you could try.

Here's my demo. If you want the whole version..let me know.

MessageDigest oMessageDigest = MessageDigest.getInstance("SHA-1"Wink;
oMessageDigest.reset();
byte[] bPasswordInBytes = sPassword.getBytes();
oMessageDigest.update(bPasswordInBytes);
byte[] bPasswordOutBytes = oMessageDigest.digest(); // encrpyted string

The only problem with the demo is decrypting it back. I could maybe give it a shot myself decrypting it too. PM me...


Author

RE: n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 01-04-08 20:34
Your inbox is full.


Author

RE: n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 02-04-08 03:07
cain and abel is a good tool to use!




Author

RE: n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 02-04-08 05:00
Don't know how but I'll give you and tip.

Don't try to get 100% tables.. (if you don't have a supercomputer)
The lower your chainlength is the faster you can crack. But you got worse %.
You have to balance that.

For example.

Properties:

Hash: Sha1
Min length: 1
Max length: 5
Index: 0
Chain length: 100
Chain count: 2000000
Number of tables: 1
Charset: Loweralpha-numeric

Table properties:

Keyspace: 62193780
Disk space: 30.51 MB (You can offer so much.. you can high the chain count to get the % better.)
Success probability: 0.852212 (85,22%)

Benchmark (got a slow computer at moment):

Hash speed: 1065189 hash/sec
Step speed: 945537 step/sec
Table precomputation time: 3.52533 minutes
Total percomputation time: 3.52533 minutes
Max cryptoanalysis time: 0.005288 seconds (fast, faster, fastest, rt)

That's a example of the settings.

Hope this helped you and have a nice day!


Author

RE: n00b rainbow tables question.


Member

Your avatar

Posts:
Location:
Joined: 01.01.70
Rank:
Guest
Posted on 02-04-08 07:13
well on google every thing i find when i type sha1 decryptor is

http://www.md5enc. . .