Let's try out some 1.0 releases for all major OSes!

[Bitweasil]

Can some people please test these to ensure they work as advertised? I *think* my build scripts are good now...

==================

First up: MacOS.

http://www.cryptohaze.com/releases/Cryp ... OS.tar.bz2

This should be a stable, fully functional set of rainbow table tools for 64-bit MacOS/CUDA.

Please test and verify.

[Bitweasil]

Linux release:

http://www.cryptohaze.com/releases/Cryp ... ux.tar.bz2

[Bitweasil]

And, finally, Windows. With the shiny new GUI & not just len7.

http://www.cryptohaze.com/releases/Cryp ... _0-Win.zip

==============

Feedback welcome - I'd love for someone to test these out, since I don't have any "non-dev" systems.

[MaddGamer]

Testing out Windows build, so far it is off and building a md5 len 6 chr95 tables without any issues. Once this is complete I will run it through some generated hashes and see how it does.

Code: Select all

GRTGen.exe -h MD5 -c .\charsets\charsetall -l 6 -i 0 --chainlength 100000 --numchains 10000000 --numtables 10

Cryptohaze GRTGen 1.00

GRTGenerateTable: Hash: 16  Pass: 16
GRTGenerateTableMD5::GRTGenerateTableMD5()
Table generation information:

  Hash type: MD5
  Password length: 6
  Table index: 0
  Number of chains: 10000000
  Number of tables: 10
  Chain length: 100000
  Generate seed: 1262147804
  Charset filename: .\charsets\charsetall


GRTGenerateTableMD5::copyConstantsToGPU()


Creating table 1 of 10

Creating GRTV2 output table.
Generating V2 table with 128 bits in hash.
Random seed: 1262147804
Output to: parts/MD5-len6-idx0-chr95-cl100000-sd1262147804-0-v2.part

Step rate is ~350M/s on a quadro fx 4800

Not sure if I missed it somewhere, but any rough estimate for when support for SHA1 hashes will be added?

[Bitweasil]

Not sure if I missed it somewhere, but any rough estimate for when support for SHA1 hashes will be added?

When enough people find it to be useful...

You interested?

[MaddGamer]

Yes, the primary system that I do audits on uses SHA1, so being able to move from my cpu based tables to gpu ones would b e great as I could start to build for some longer sets.

[Bitweasil]

Noted.

[MaddGamer]

Alright, so I build out 4 sets of tables and sent to merge each of the set's parts together and am getting the following error. What is the proper order of steps for me to end up with an indexed, perfect grt table to then run grtcrack against?

Code: Select all

grtmerge --buildfull parts\MD5-len6-idx0-chr95-cl100000*

Table version:   2
Hash:            MD5
Password length: 6
Table index:     0
Chain length:    100000
Num chains:      10000000
Perfect table:   No
Charset length:  95
Charset:          !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR
                 STUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~



Checking Files... 9 / 10

Total to merge: 10
Output dir: output
You must set bits in output to use V2 tables!

[MaddGamer]

Was able to get past the GRTMerge error by opening up the source code and saw the --bits option

Code: Select all

grtmerge --buildfull --bits 128 -m 8196 parts\MD5-len6-idx0*.part

Table version:   2
Hash:            MD5
Password length: 6
Table index:     0
Chain length:    100000
Num chains:      10000000
Perfect table:   No
Charset length:  95
Charset:          !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR
                 STUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~



Checking Files... 9 / 10

Total to merge: 10
Output dir: output
Writing full table to output/MD5-len6-idx0-chr95-cl100000-v2-full.grt
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-0-v2.part.idx
Table 0 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-1-v2.part.idx
Table 1 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-2-v2.part.idx
Table 2 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-3-v2.part.idx
Table 3 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-4-v2.part.idx
Table 4 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-5-v2.part.idx
Table 5 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-6-v2.part.idx
Table 6 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-7-v2.part.idx
Table 7 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-8-v2.part.idx
Table 8 bits in hash: 128, requested 128
Cannot find index file parts\MD5-len6-idx0-chr95-cl100000-sd1262147804-9-v2.part.idx
Table 9 bits in hash: 128, requested 128
Total elements to merge: 100000000
Reading 9/10 (100.00 % done)   Sorting 100000000 elements...
Writing full table output...
Written 99000000 / 100000000  (99.00%)


[MaddGamer]

Alright final report back on MD5 len 6 from table generation to cracking hashes.

Some issues.

GRTIndex on windows does not work


Code: Select all

GRTIndex.exe -b 32 output\test\MD5-len6-idx0-chr95-cl100000-v2-full.grt
Creating index for file 1/1...
Cannot open table `.*: fopen failed.
ERROR making index: Cannot read table file `.*!


Index creation complete.


GRTCrack does not exit on q, but pause does work
GRTCrack dies if there are no .idx files for the .grt tables

Something that may or may not be an issue

On an earlier post it was mentioned that each part of a table that has the same index should have a different seed, when running GRTGen with --numtables > 1 all the parts will have the same seed number. I may have been reading into the earlier statement incorrectly... The number of chains after perfecting both of the following table spaces had close to the same number of chains.


Code: Select all

MD5-len6-idx0-chr95-cl100000-sd1262147804-0-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-1-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-2-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-3-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-4-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-5-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-6-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-7-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-8-v2.part
MD5-len6-idx0-chr95-cl100000-sd1262147804-9-v2.part


vs


Code: Select all

MD5-len6-idx400000-chr95-cl100000-sd1604944486-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd227940589-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd2301586106-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd2846198854-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd2895702407-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd304260506-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd3518003065-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd4190472286-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd4190814619-0-v2.part
MD5-len6-idx400000-chr95-cl100000-sd727839076-0-v2.part

I wasn't sure on what size to run things so for a first run I left GRTMerge with 128 bits, and GRTIndex with 32 bits. I made a hash list of 10 values and put it against my 4 perfect grt tables.

Code: Select all

7 hashes were cracked by table 1 in 6 minutes
2 more hashes were cracked by table 2 in a total of 7 minutes 45 seconds
the last hash was cracked by table 3 at about 8 minutes 30 seconds

Thread 0 out of WU
Num Hashes: 1
To regen: 62449
Merged chains: 62449
Chains found: 62449
Bits of index: 32
Loaded 10990804 indexes
CH after merge: 99753
CH before merge: 100000
Thread 0 out of WU
Num Chains: 11004989
Chain Len: 100000
Index: 600000
Pass Len: 6
Table Ver: 2
Table Info
Thread 0 out of WU
Num Hashes: 3
To regen: 185325
Merged chains: 185325
Chains found: 185325
Bits of index: 32
Loaded 10996078 indexes
CH after merge: 297507
CH before merge: 300000
Thread 0 out of WU
Num Chains: 11010082
Chain Len: 100000
Index: 300000
Pass Len: 6
Table Ver: 2
Table Info
Thread 0 out of WU
Num Hashes: 10
To regen: 601935
Merged chains: 601935
Chains found: 601935
Bits of index: 32
Loaded 10993541 indexes
CH after merge: 974158
CH before merge: 1000000
Thread 0 out of WU
Num Chains: 11007801
Chain Len: 100000
Index: 0
Pass Len: 6
Table Ver: 2
Table Info
Loaded 10 hashes
0AE52B9717B5D945969CBBADFCD813CE:bt@9@=
378CDD5266ADD34BE14EA19DB3C07774:7_H+OZ
52FC8151B7C6BD7C2978C8C686B26AA9:VbBcc{
624FF5A9339CAB4B55EF667A0094ECCF:Cl}ePa
9457A7603CA3236A125A4E08740183DF:PW}ycN
9F58A309DDC99931D48B91542CDECE6D:XL\?w^
B0DC6A69104D15F57C830FB082FF27CC:C]UK|7
E155106EA95FBFEE58F2BE805170B9E9:U<z2\r
E468C26F2769449E3E2E4A1F026E2A9E:q~juq
F8E9A3E6C2D91EFFEF4F7A066ECC6BF7:Av#q5:


I also ran GRTCrack against a hashlist of 100 values to test the percentage of passwords the tables would find. The CH gen time was slow with that many hashes but I was able to crack 100/100 in 60 minutes again only using 3 of 4 tables, compared with 40 minutes for Multiforcer.

Conversely using GRTCrack for what rainbow tables are good for, 1 hash was found in 26 seconds with the first table, while Multiforcer took 26 minutes for the same random hash.