is ZOTAC P102-100 useful for hashcat?
↧
P102-100 for hashcat
↧
5.1.0-91+ needed (I think)
I'm using an RX580 AMD card to try and use a combination attack on a hccapx file and I'm getting this error
* Device #1: ATTENTION! OpenCL kernel self-test failed.
Your device driver installation is probably broken.
See also: https://hashcat.net/faq/wrongdriver
Aborting session due to kernel self-test failure.
You can use --self-test-disable to override this, but do not report related errors.n.
I have been doing some reading around the forums and came across some people that said 5.1.0 has issues with AMD cards and that beta 91 or higher fixes the problem. Where can I find this download, I've searched everywhere. Perhaps someone can email it to me? Or perhaps someone knows how to fix this issue. My card is updated to the latest driver by the way
* Device #1: ATTENTION! OpenCL kernel self-test failed.
Your device driver installation is probably broken.
See also: https://hashcat.net/faq/wrongdriver
Aborting session due to kernel self-test failure.
You can use --self-test-disable to override this, but do not report related errors.n.
I have been doing some reading around the forums and came across some people that said 5.1.0 has issues with AMD cards and that beta 91 or higher fixes the problem. Where can I find this download, I've searched everywhere. Perhaps someone can email it to me? Or perhaps someone knows how to fix this issue. My card is updated to the latest driver by the way
↧
↧
Is AMD threadripper 1900x still a good value cpu to have in your cracking rig?
As I keep going through old posts on here doing research for my first build. People have talked about amd threadripper 1900x being good value for the money. But the posts that said this were mid-late 2018 to mid 2019, is that still the case or should I consider a different budget cpu? If it helps im planning to run 2 *MAYBE* 3 1080 TI FE, and 32-48gb of ram.
↧
Password Hash Identification
Hi,
I am new to the usage of hashcat, and I am to decrypt a password here it is:
[redacted]
I wanna decrypt it with hashcat and I would appreciate any assistance.
Thanks.
I am new to the usage of hashcat, and I am to decrypt a password here it is:
[redacted]
I wanna decrypt it with hashcat and I would appreciate any assistance.
Thanks.
↧
LastPass new App hash extraction explanation
Thanks to @Chick3nman, I came to the attention that LastPass has a new native App and is NOT directly using the browser extension architecture on macOS anymore, see:
https://www.theverge.com/2020/1/29/21113...ion-update
also see the "LastPass Mac App" from https://lastpass.com/misc_download2.php#tab-mac (click on "Mac" tab)
It seems to work similar to older versions, but I couldn't immediately find the place where the iteration count was stored (see some explanation of the older ways to extract data from LastPass for instance here: https://hashcat.net/forum/thread-2701-po...l#pid16028)
I've played around with this a little bit a while ago and it seems that the stored data is still using some browser data ("local storage") and on a test system I could play for a few hours, I found the IndexedDB sqlite3 database in:
therefore, it is a IndexedDB.sqlite file in the WebKit folder (and "com.lastpass.lastpassmacdesktop" subfolder)
The data of those IndexedDB.sqlite file is of course very generic, because these local storage containers/databases can store of course any values/blobs... Therefore, the format is a little bit strange...
anyway, you could easily find a key-value pair within that "lastpassmacdesktop" WebKit Local storage IndexedDB.sqlite file containing the sub-string "iterations="
note the hex value 697465726174696f6e733d is just iterations= if you convert it from hex to ASCII.
At the end, I use a SQL query like this to get the needed data for the hashcat hash type -m 6800 = LastPass
so the value for the iterations is 100100 (default), but this value of course could be changed
https://www.theverge.com/2020/1/29/21113...ion-update
also see the "LastPass Mac App" from https://lastpass.com/misc_download2.php#tab-mac (click on "Mac" tab)
It seems to work similar to older versions, but I couldn't immediately find the place where the iteration count was stored (see some explanation of the older ways to extract data from LastPass for instance here: https://hashcat.net/forum/thread-2701-po...l#pid16028)
I've played around with this a little bit a while ago and it seems that the stored data is still using some browser data ("local storage") and on a test system I could play for a few hours, I found the IndexedDB sqlite3 database in:
Code:
~/Library/WebKit/com.lastpass.lastpassmacdesktop/WebsiteData/IndexedDB/file__0/lp/IndexedDB.sqlitetherefore, it is a IndexedDB.sqlite file in the WebKit folder (and "com.lastpass.lastpassmacdesktop" subfolder)
The data of those IndexedDB.sqlite file is of course very generic, because these local storage containers/databases can store of course any values/blobs... Therefore, the format is a little bit strange...
anyway, you could easily find a key-value pair within that "lastpassmacdesktop" WebKit Local storage IndexedDB.sqlite file containing the sub-string "iterations="
Code:
SELECT HEX (value) FROM Records WHERE LOWER(HEX(value)) LIKE '%697465726174696f6e733d%';note the hex value 697465726174696f6e733d is just iterations= if you convert it from hex to ASCII.
At the end, I use a SQL query like this to get the needed data for the hashcat hash type -m 6800 = LastPass
Code:
SELECT SUBSTR(i,0,INSTR(i,';')) FROM (SELECT SUBSTR(value,INSTR(value,X'697465726174696F6E733D')+11) AS i FROM Records WHERE INSTR(value,X'697465726174696F6E733D'));
100100so the value for the iterations is 100100 (default), but this value of course could be changed
↧
↧
hashcat has to read through wordlist when using restore or --skip
Maybe this could be a possible speed improvement for hashcat with using restore or --skip:
Been running a 3-4 day run with a 157 GB wordlist the initial restore/--skip part takes 15+ mins to restore due to having to READ through the huge wordlist, (I'm currently at 82% so A LOT of reading). I run every day for ~10 hours as I have solar panels so does not cost me anything to run, but does mean I have to restore a previous session.
Seems pointless when the .restore file could also store the byte position in the wordlist file so, instant start basically with a simple change.
He could even store the byte position every 5% in the .dictstat2 file so, when using --skip, it can work out the lower % and skip straight to it, then read upto the --skip value, easy and FASTER!
Seem feasable?
FYI, if you want to download the 157 GB wordlist, find it below in 7zip chunks:
http://share.blandyuk.co.uk/wordlists/huge/
Been running a 3-4 day run with a 157 GB wordlist the initial restore/--skip part takes 15+ mins to restore due to having to READ through the huge wordlist, (I'm currently at 82% so A LOT of reading). I run every day for ~10 hours as I have solar panels so does not cost me anything to run, but does mean I have to restore a previous session.
Seems pointless when the .restore file could also store the byte position in the wordlist file so, instant start basically with a simple change.
He could even store the byte position every 5% in the .dictstat2 file so, when using --skip, it can work out the lower % and skip straight to it, then read upto the --skip value, easy and FASTER!
Seem feasable?
FYI, if you want to download the 157 GB wordlist, find it below in 7zip chunks:
http://share.blandyuk.co.uk/wordlists/huge/
↧
Newbie learning how to crack a RAR3 hash.
Hi everyone, Im a newbie to hashcat. Im trying to use hashcat for a hash I got from john the ripper for a .rar file i was trying to get the password of. I have genuinely lost its password so I got hashcat so I can run it to crack the hash and get the password. Sorry for the long ramble but anyways, my issue is that I get this message when i use this command in cmd. (using hashcat on windows).
My Command :- hashcat64.exe -a 3 -m 12500 RAR3-hp -w 3 $RAR3$*0*(bunch of hash numbers here)*(and a bunch here).
Note: not putting in these "(" ")" in so don't worry lol.
and this is what i get for the output.
Output :- Hash 'RAR3-hp': Separator unmatched
No hashes loaded.
Am I doing something dumb? or am I missing something? when I ran the hash on john the ripper, It said this
The command I used for JTR :- john --format=rar hash2.txt (hash2.txt is the txt file i had john the ripper save the hash in.)
Using default input encoding: UTF-8
Loaded 1 password hash (rar, RAR3 [SHA1 256/256 AVX2 8x AES])
Please help. I cannot find anything useful on youtube or on google so I thought I'd ask you all directly through here.
TL![Big Grin]( "Big Grin")
R : I'm new and please help me check if Im doing this right lol.
My Command :- hashcat64.exe -a 3 -m 12500 RAR3-hp -w 3 $RAR3$*0*(bunch of hash numbers here)*(and a bunch here).
Note: not putting in these "(" ")" in so don't worry lol.
and this is what i get for the output.
Output :- Hash 'RAR3-hp': Separator unmatched
No hashes loaded.
Am I doing something dumb? or am I missing something? when I ran the hash on john the ripper, It said this
The command I used for JTR :- john --format=rar hash2.txt (hash2.txt is the txt file i had john the ripper save the hash in.)
Using default input encoding: UTF-8
Loaded 1 password hash (rar, RAR3 [SHA1 256/256 AVX2 8x AES])
Please help. I cannot find anything useful on youtube or on google so I thought I'd ask you all directly through here.
TL
R : I'm new and please help me check if Im doing this right lol.
↧
Splitting Hashes
Hi,
Is there is a way to split a hash in half, for example the below hash is of a 10 character password Alpha-numeric [A-Z 0-9]
$zip2$*0*1*0*823be6152d3cb0d7*69a5*b*a3ea3f7a6517db2cb94170*2e8026d64b739432b6d8*$/zip2$
Mask attack with ?H?H?H?H?H?H?H?H?H?H takes 8 days but if I were to split the hash in 2 and crack 5 characters at a time would take 3 seconds.
Anyone knows if this is possible?
Is there is a way to split a hash in half, for example the below hash is of a 10 character password Alpha-numeric [A-Z 0-9]
$zip2$*0*1*0*823be6152d3cb0d7*69a5*b*a3ea3f7a6517db2cb94170*2e8026d64b739432b6d8*$/zip2$
Mask attack with ?H?H?H?H?H?H?H?H?H?H takes 8 days but if I were to split the hash in 2 and crack 5 characters at a time would take 3 seconds.
Anyone knows if this is possible?
↧
HC and Blowfish Advanced CS Help
All,
I am looking for help with getting HC to run against some keys and salts extracted from .bfa files encrypted by Blowfish Advanced CS 2.57 (on sourceforge).
I read through their manual and found the following excerpt:
"Let our password be "helloworld". We want to create a key of 128 bits (16 bytes). The SHA-1 allows us to input as much data bytes as we want to, and puts out a hash of 160 bits (20 bytes). A hash (also called digest) is the same like a CRC32 checksum, but secure for encryption purposes.
To resize the 20 bytes of the hash to the required 16 bytes for the key we take the first 16 bytes of the hash and XOR the rest of 4 bytes over the beginning of these 16 bytes. By this we don't ignore any part of the hash:
password: "helloworld"
|
SHA-1
|
a3d4ff09e22710946702eab2cc382596a8e3197322
a3d4ff09e22710946702eab2cc382596a8
||||||||
XOR e3197322
||||||||
key: 40cd8c2be22710946702eab2cc382596a8
In the second example we assume that our password is still "helloworld" but we need a key for Blowfish which has the required length of 56 bytes.
As already mentioned SHA-1 only returns 20 bytes. So we have to create 36 additional bytes from the password by the following way: we hash the password with SHA-1 and get 20 bytes. Then we add those 20 bytes to the original password and hash the modified password again. The result is a new hash which means 20 new bytes for our key. Due to the modified password this new hash is completely different from the first one. Now we append this second hash to the modified password again and rehash it to get the last 20 bytes. Of course now we have 4 bytes too much, so we XOR them over the first hash as we did in the first example. Now we have the needed 56 bytes for the Blowfish encryption algorithm.
Please remember that your password is always combined with 11 bytes of salt."
Any help is appreciated.
<-Romeo3442->
I am looking for help with getting HC to run against some keys and salts extracted from .bfa files encrypted by Blowfish Advanced CS 2.57 (on sourceforge).
I read through their manual and found the following excerpt:
"Let our password be "helloworld". We want to create a key of 128 bits (16 bytes). The SHA-1 allows us to input as much data bytes as we want to, and puts out a hash of 160 bits (20 bytes). A hash (also called digest) is the same like a CRC32 checksum, but secure for encryption purposes.
To resize the 20 bytes of the hash to the required 16 bytes for the key we take the first 16 bytes of the hash and XOR the rest of 4 bytes over the beginning of these 16 bytes. By this we don't ignore any part of the hash:
password: "helloworld"
|
SHA-1
|
a3d4ff09e22710946702eab2cc382596a8e3197322
a3d4ff09e22710946702eab2cc382596a8
||||||||
XOR e3197322
||||||||
key: 40cd8c2be22710946702eab2cc382596a8
In the second example we assume that our password is still "helloworld" but we need a key for Blowfish which has the required length of 56 bytes.
As already mentioned SHA-1 only returns 20 bytes. So we have to create 36 additional bytes from the password by the following way: we hash the password with SHA-1 and get 20 bytes. Then we add those 20 bytes to the original password and hash the modified password again. The result is a new hash which means 20 new bytes for our key. Due to the modified password this new hash is completely different from the first one. Now we append this second hash to the modified password again and rehash it to get the last 20 bytes. Of course now we have 4 bytes too much, so we XOR them over the first hash as we did in the first example. Now we have the needed 56 bytes for the Blowfish encryption algorithm.
Please remember that your password is always combined with 11 bytes of salt."
Any help is appreciated.
<-Romeo3442->
↧
↧
Any hashcat user with AMD cards on macOS wanted for troubleshooting
Unfortunately, the developer team has no such hardware (new Apple iMac or iMac pro or any new high-end macbook with AMD cards) to test some problems with macOS (we believe only latest version and/or new AMD driver).
We get complains about not being able to compile latest hashcat with error:
see https://github.com/hashcat/hashcat/issue...-625173962 and other reports here:
https://github.com/hashcat/hashcat/searc...ype=Issues
It would be nice if we could get some help from hashcat users that have such a hardware to test and want to play around a little bit with the changes/code etc:
1. does this happen only with a specific macOS/driver version
2. when was this introduced ? already available with release versions , which commit introduced this error: https://github.com/hashcat/hashcat/commits
3. why does it happen ? any clue about why the file can't be found ? maybe related to some paths etc (we already have some other problems with compiler include problems with AMD/ROCm using paths with -I ).
etc etc etc
it would be great if somebody could play around a little bit with latest git code (master branch) and try also older commits or versions of hashcat to see when this was introduced and if it even has something to do with hashcat or is ... as very often .. just a driver problem.
Our current educated guess is that it is a specific new AMD include problem (using the JiT compilers -I include paths) and that this problem is related to some (new) AMD driver version etc...
Thank you very much
It is needless to say, that first you need to be able to reproduce/see this "file not found" error, otherwise you might not be able to help much... but any feedback (even saying "it works with AMD card with macOS version XYZ") could help to pinpoint it
(you could of course contact us here below, or via PM, or on #hashcat IRC, freendode etc)
We get complains about not being able to compile latest hashcat with error:
Code:
fatal error: 'inc_vendor.h' file not found
#include "inc_vendor.h"
^see https://github.com/hashcat/hashcat/issue...-625173962 and other reports here:
https://github.com/hashcat/hashcat/searc...ype=Issues
It would be nice if we could get some help from hashcat users that have such a hardware to test and want to play around a little bit with the changes/code etc:
1. does this happen only with a specific macOS/driver version
2. when was this introduced ? already available with release versions , which commit introduced this error: https://github.com/hashcat/hashcat/commits
3. why does it happen ? any clue about why the file can't be found ? maybe related to some paths etc (we already have some other problems with compiler include problems with AMD/ROCm using paths with -I ).
etc etc etc
it would be great if somebody could play around a little bit with latest git code (master branch) and try also older commits or versions of hashcat to see when this was introduced and if it even has something to do with hashcat or is ... as very often .. just a driver problem.
Our current educated guess is that it is a specific new AMD include problem (using the JiT compilers -I include paths) and that this problem is related to some (new) AMD driver version etc...
Thank you very much
It is needless to say, that first you need to be able to reproduce/see this "file not found" error, otherwise you might not be able to help much... but any feedback (even saying "it works with AMD card with macOS version XYZ") could help to pinpoint it
(you could of course contact us here below, or via PM, or on #hashcat IRC, freendode etc)
↧
The Brain not working as expected (or is it me?)
First of all, i read the full announcement regarding the brain and THOUGHT i understand it, but seems not...
https://hashcat.net/forum/thread-7903.html
so i started some tests using brain server and client with client-features=3. i used a very basic setup (md5 to crack and a simple dictionary)
first run (one matching pw in dict-1.txt)
worked as expected
second run (added one new matching pw to dict -> dict2.txt
worked as expected, rejected 10 old already testet pw , just using the new one, recovered one new hash, perfekt
now i simulated some other work, blabla, my dict is evolving to dict-3 and now im getting a new hashlist from somewhere else (hash-2.txt) with some already known pw (potfile to the rescue) but also some new hashes with "old" pw within dict-3.txt
not working as i expected, brain rejected 11 pw from dict-3 but these pw where never testet against this new file hash-2.txt
i thought the brain stores a hash of the input file, to track attacks versus that file but seems not?
so how can i achieve, that the brain tracks attacks but also recognize new files the correct way?
https://hashcat.net/forum/thread-7903.html
so i started some tests using brain server and client with client-features=3. i used a very basic setup (md5 to crack and a simple dictionary)
first run (one matching pw in dict-1.txt)
Code:
.\hashcat64.exe -z --brain-client-features=3 -a 0 -m 0 .\hash-1.txt .\dict-1.txt
Recovered........: 1/5 (20.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 10/10 (100.00%)
Rejected.........: 0/10 (0.00%)worked as expected
second run (added one new matching pw to dict -> dict2.txt
Code:
.\hashcat64.exe -z --brain-client-features=3 -a 0 -m 0 .\hash-1.txt .\dict-2.txt
Recovered........: 2/5 (40.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 11/11 (100.00%)
Rejected.........: 10/11 (90.91%)worked as expected, rejected 10 old already testet pw , just using the new one, recovered one new hash, perfekt
now i simulated some other work, blabla, my dict is evolving to dict-3 and now im getting a new hashlist from somewhere else (hash-2.txt) with some already known pw (potfile to the rescue) but also some new hashes with "old" pw within dict-3.txt
Code:
.\hashcat64.exe -z --brain-client-features=3 -a 0 -m 0 .\hash-2.txt .\dict-3.txt
Recovered........: 3/10 (30.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 12/12 (100.00%)
Rejected.........: 11/12 (91.67%)not working as i expected, brain rejected 11 pw from dict-3 but these pw where never testet against this new file hash-2.txt
i thought the brain stores a hash of the input file, to track attacks versus that file but seems not?
so how can i achieve, that the brain tracks attacks but also recognize new files the correct way?
↧
Slow-candidates for hybrid attacks
Heya,
could someone please enlighten me. Why isn't --slow-candidates enabled for hybrid attacks? What are the implementation issues? Naively, I'd think that most challenges should be dealt with/implemented for other attacks already and hybrids would be only about putting the pieces together?
Thanks
could someone please enlighten me. Why isn't --slow-candidates enabled for hybrid attacks? What are the implementation issues? Naively, I'd think that most challenges should be dealt with/implemented for other attacks already and hybrids would be only about putting the pieces together?
Thanks
↧
separator unmatched
hi newbie here. i really need help. i got errors "on line 1 (�.�t�$'�): Token length exception" . i have tried all methods and tried find the solution on google but still same. can anyone help me? almost give up.
↧
↧
32 Hash Characters
hi i wanna ask is it possible to crack 32 Hash Characters like example below?
this is only example : a70ec6f391b50a8ce7e2e07798e028f1
because ive tried without mask and with mask but still failed. i also tried with 11 mask almost then the result is exhausted.
Below with mask almost succeed then suddenly it exhausted:
Session..........: hashcat
Status...........: Running
Hash.Type........: MD5
Hash.Target......: Hash code
Time.Started.....: Sat May 09 00:32:32 2020 (1 hour, 5 mins)
Time.Estimated...: Sat May 09 01:40:34 2020 (2 mins, 36 secs)
Guess.Mask.......: ?l?d?d?h?l?h?l?d?d?h?l [11]
Guess.Queue......: 1/1 (100.00%)
Speed.#1.........: 4583.4 MH/s (8.24ms) @ Accel:256 Loops:128 Thr:256 Vec:1
Recovered........: 0/1 (0.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 18000366796800/18717736960000 (96.17%)
Rejected.........: 0/18000366796800 (0.00%)
Restore.Point....: 6922895360/7199129600 (96.16%)
Restore.Sub.#1...: Salt:0 Amplifier:2432-2560 Iteration:0-128
Candidates.#1....: f39edcn345u -> k76fa8f699q
Hardware.Mon.#1..: Temp: 74c Fan: 64% Util: 96% Core:1683MHz Mem:3504MHz Bus:16
Approaching final keyspace - workload adjusted.
Session..........: hashcat
Status...........: Exhausted
Hash.Type........: MD5
Hash.Target......: Hash code
Time.Started.....: Sat May 09 00:32:32 2020 (1 hour, 8 mins)
Time.Estimated...: Sat May 09 01:40:34 2020 (0 secs)
Guess.Mask.......: ?l?d?d?h?l?h?l?d?d?h?l [11]
Guess.Queue......: 1/1 (100.00%)
Speed.#1.........: 4586.1 MH/s (8.19ms) @ Accel:256 Loops:128 Thr:256 Vec:1
Recovered........: 0/1 (0.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 18717736960000/18717736960000 (100.00%)
Rejected.........: 0/18717736960000 (0.00%)
Restore.Point....: 7199129600/7199129600 (100.00%)
Restore.Sub.#1...: Salt:0 Amplifier:2560-2600 Iteration:0-128
Candidates.#1....: h76ee8s64fq -> x88fq6u57fq
Hardware.Mon.#1..: Temp: 74c Fan: 64% Util: 96% Core:1683MHz Mem:3504MHz Bus:16
this is only example : a70ec6f391b50a8ce7e2e07798e028f1
because ive tried without mask and with mask but still failed. i also tried with 11 mask almost then the result is exhausted.
Below with mask almost succeed then suddenly it exhausted:
Session..........: hashcat
Status...........: Running
Hash.Type........: MD5
Hash.Target......: Hash code
Time.Started.....: Sat May 09 00:32:32 2020 (1 hour, 5 mins)
Time.Estimated...: Sat May 09 01:40:34 2020 (2 mins, 36 secs)
Guess.Mask.......: ?l?d?d?h?l?h?l?d?d?h?l [11]
Guess.Queue......: 1/1 (100.00%)
Speed.#1.........: 4583.4 MH/s (8.24ms) @ Accel:256 Loops:128 Thr:256 Vec:1
Recovered........: 0/1 (0.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 18000366796800/18717736960000 (96.17%)
Rejected.........: 0/18000366796800 (0.00%)
Restore.Point....: 6922895360/7199129600 (96.16%)
Restore.Sub.#1...: Salt:0 Amplifier:2432-2560 Iteration:0-128
Candidates.#1....: f39edcn345u -> k76fa8f699q
Hardware.Mon.#1..: Temp: 74c Fan: 64% Util: 96% Core:1683MHz Mem:3504MHz Bus:16
Approaching final keyspace - workload adjusted.
Session..........: hashcat
Status...........: Exhausted
Hash.Type........: MD5
Hash.Target......: Hash code
Time.Started.....: Sat May 09 00:32:32 2020 (1 hour, 8 mins)
Time.Estimated...: Sat May 09 01:40:34 2020 (0 secs)
Guess.Mask.......: ?l?d?d?h?l?h?l?d?d?h?l [11]
Guess.Queue......: 1/1 (100.00%)
Speed.#1.........: 4586.1 MH/s (8.19ms) @ Accel:256 Loops:128 Thr:256 Vec:1
Recovered........: 0/1 (0.00%) Digests, 0/1 (0.00%) Salts
Progress.........: 18717736960000/18717736960000 (100.00%)
Rejected.........: 0/18717736960000 (0.00%)
Restore.Point....: 7199129600/7199129600 (100.00%)
Restore.Sub.#1...: Salt:0 Amplifier:2560-2600 Iteration:0-128
Candidates.#1....: h76ee8s64fq -> x88fq6u57fq
Hardware.Mon.#1..: Temp: 74c Fan: 64% Util: 96% Core:1683MHz Mem:3504MHz Bus:16
↧
Hashcat RAM usage
hashcatRAM.PNG (Size: 12.93 KB / Downloads: 1)
Hello guys,
I have noticed that my RAM usage is extremely high when running hashcat, while the GPU is chilling at 1%.
Do you have any idea why this happening and is it normal to operate like this?
Thanks in advance.
↧
Meltdown and Spectre patches
Is it worth turning off in case of hashcat rig? Will there be an increase in performance?
↧
Cracking bcrypt hash using brute force mode
Hello I'm very new to this
I'm trying to crack a 4 letter password (bcrypt hash) with the possibility of containing noncapital, capital letters and numbers
example: FvL6, wm4n
This is the cmd I ran
hashcat64.exe -m 3200 -a 3 -w 2 --custom-charset1=?l?u?d -i --increment-min 4 --increment-max 4 Ha123.txt ?a?a?a?a -o Cracked.txt
But estimated time was not practical. It was wondering if I'm doing something wrong.
Thank you for helping me and hopefully, my post isn't breaking any rules.
I'm trying to crack a 4 letter password (bcrypt hash) with the possibility of containing noncapital, capital letters and numbers
example: FvL6, wm4n
This is the cmd I ran
hashcat64.exe -m 3200 -a 3 -w 2 --custom-charset1=?l?u?d -i --increment-min 4 --increment-max 4 Ha123.txt ?a?a?a?a -o Cracked.txt
But estimated time was not practical. It was wondering if I'm doing something wrong.
Thank you for helping me and hopefully, my post isn't breaking any rules.
↧
↧
Using a combo of masks and rules
Hello. Been toying around with hashcat using my own network, trying to better understand how it (and many things) work by coming up with different scenarios and then testing it out. The basic wordlists and brute force attacks (with simple masks) are pretty straight forward. Coming up with more complex scenarios I can't build out what I want based on the documentation I have found so far.
For example right now I want to utilize masks to generate my wordlist but I want to customize it further to narrow down the combinations. Lets say I know the password contains an "_" and a "b" I want to use a custom charset ?l?u?d!#$^&-'"_ with a ?1?1?1?1?1?1?1?1 mask. But I want to tell it that all words must include an _ (or whatever character, or multiple characters) anywhere in the string.
I came up with this (using maskprocessor), and I assume it's technically working but it is insanely slow (the updates show Utilization is 0%). It may not be working as I intended as each iteration of hashcat's output has progress at 0, speed at 0, and the Candidates.#1 just says [Copying]
mp64 -q 2 -i 8:10 -1 ?l?u?d!#$^&-'"_ ?1?1?1?1?1?1?1?1?1?1 | hashcat64 -m 16800 -a 0 C:\hashcat-5.1.0\hash.16800 -O -w 3 -j /_
As I understand it, maskprocessor is just building a wordlist using the charset and mask. Then I'm using -j to reject anything that doesn't have an "_" (can it reject if multiple chars are missing?)
Is piping just going to be slow? Is there a better way to do this?
This is the only way I've found to combine masks and rules. I've not seen anything anywhere where a .hcmask file can be used with a .rules file. But maybe no one has created any articles about it. I'm just toying around with making more advanced attempts with limited information and working through how to think about these things.
If all of that was confusing, here is the short of it:
I want to attempt all possible combinations for a password 8 chars long (or 6-10 for a range) but only if they include an _ (or multiple characters, any arrangement... ex) must include _ and b so.... owu09_rb and b93g_o9e would be included but kgoe85_t would not).
Is it possible?
For example right now I want to utilize masks to generate my wordlist but I want to customize it further to narrow down the combinations. Lets say I know the password contains an "_" and a "b" I want to use a custom charset ?l?u?d!#$^&-'"_ with a ?1?1?1?1?1?1?1?1 mask. But I want to tell it that all words must include an _ (or whatever character, or multiple characters) anywhere in the string.
I came up with this (using maskprocessor), and I assume it's technically working but it is insanely slow (the updates show Utilization is 0%). It may not be working as I intended as each iteration of hashcat's output has progress at 0, speed at 0, and the Candidates.#1 just says [Copying]
mp64 -q 2 -i 8:10 -1 ?l?u?d!#$^&-'"_ ?1?1?1?1?1?1?1?1?1?1 | hashcat64 -m 16800 -a 0 C:\hashcat-5.1.0\hash.16800 -O -w 3 -j /_
As I understand it, maskprocessor is just building a wordlist using the charset and mask. Then I'm using -j to reject anything that doesn't have an "_" (can it reject if multiple chars are missing?)
Is piping just going to be slow? Is there a better way to do this?
This is the only way I've found to combine masks and rules. I've not seen anything anywhere where a .hcmask file can be used with a .rules file. But maybe no one has created any articles about it. I'm just toying around with making more advanced attempts with limited information and working through how to think about these things.
If all of that was confusing, here is the short of it:
I want to attempt all possible combinations for a password 8 chars long (or 6-10 for a range) but only if they include an _ (or multiple characters, any arrangement... ex) must include _ and b so.... owu09_rb and b93g_o9e would be included but kgoe85_t would not).
Is it possible?
↧
Maskprocessor Help Windows 10
I'm trying to optimize hash cracking for WPA2 passwords.
Max is 86,925 H/s on my NVIDIA GTX 1050 Ti, this doesn't seem right though because I can get 250,000 on other hash cracking programs.
Also when using hashcrack my GPU is only using 1-2%.
Did some research and noticed you can use maskprocessor to give the GPU more work, I found the commands but they all refer to mp64.exe. This file doesn't exist in the latest binary though so I can't get this working, has the command changed?
Max is 86,925 H/s on my NVIDIA GTX 1050 Ti, this doesn't seem right though because I can get 250,000 on other hash cracking programs.
Also when using hashcrack my GPU is only using 1-2%.
Did some research and noticed you can use maskprocessor to give the GPU more work, I found the commands but they all refer to mp64.exe. This file doesn't exist in the latest binary though so I can't get this working, has the command changed?
↧
3des comand
Hello people, can someone please help me, unfortunately I only have this part of the command, can someone please post the whole command, thank you very much
14100 | 3DES (PT = $salt, key = $pass) | Raw Cipher, Known-Plaintext attack
14100 | 3DES (PT = $salt, key = $pass) | Raw Cipher, Known-Plaintext attack
↧