help me with my homework!!!!

[hieuduc]

the password is an IPv4 address, how can i find it, help me pls ((
For example: 45.34.234.125 is an IPv4 address, which each one varies from 0-255(1-255.0-255.0-255.0-255)

[Snoopy]

depending on your hash (fast slow) you should consider using a simple mask attack or for the last masks some more specialised

the problem is, you have to think of the possible combinations of diffenent lenghts

first start like this
maskfile
?d.?d.?d?d -> this will test 0.0.0.0 - 9.9.9.9
now start adding length
?d.?d.?d.?d?d -> 0.0.0.00 - 9.9.9.99

you will need to generate masks for every different combinattion the different lenght like that, for every position, this should be 81 masks total

as mentioned before, depending on your hash or how fast you can attack, the last masks are definitly some you should modify or specialise for reducing the keyspace like that

1?d?d.1?d?d.1?d?d.1?d?d
12345,2?1?1.2?1?1.2?1?1.2?1?1

for more details on maskattack and maksfiles see https://hashcat.net/wiki/doku.php?id=mask_attack

or you are porgramming a little script outputting the candidates and feed hahscat through pipe

[hieuduc]

depending on your hash (fast slow) you should consider using a simple mask attack or for the last masks some more specialised

the problem is, you have to think of the possible combinations of diffenent lenghts

first start like this
maskfile
?d.?d.?d?d -> this will test 0.0.0.0 - 9.9.9.9
now start adding length
?d.?d.?d.?d?d -> 0.0.0.00 - 9.9.9.99

you will need to generate masks for every different combinattion the different lenght like that, for every position, this should be 81 masks total

as mentioned before, depending on your hash or how fast you can attack, the last masks are definitly some you should modify or specialise for reducing the keyspace like that

1?d?d.1?d?d.1?d?d.1?d?d
12345,2?1?1.2?1?1.2?1?1.2?1?1

for more details on maskattack and maksfiles see https://hashcat.net/wiki/doku.php?id=mask_attack

or you are porgramming a little script outputting the candidates and feed hahscat through pipe

I do understand your idea but i think you missunderstood something, the teacher give me only a NT hash and said that it is an IPv4 address, because it can be from 1-255.

[Snoopy]

yeah so what?

nt is mode 1000 and supported by hashcat, its a fast hash so you will be able to crack that very fast even on plain CPU and even without specialising the last masks

anyway for nt hashes, you should try crackstation.net or ntlm.pw as i bet, these ipv4 hashes are already stored there

[nick8606]

hieuduc, you have at least 2 ways.

1st way was described by Snoopy. You need to create the list of all possible masks and use mask attack. Each part of IP address can contain 1, 2 or 3 digits, i. e. number of items in the list will be 3^4 = 81.

2nd way was also mentioned by Snoopy. NTLM is very fast algorithm. Therefore, your task can be solved even without hashcat. You can create short script using almost any programming language. This script must calculate hashes for all possible IP addresses (256^4 = 4'294'967'296) and compare results with hash given by your teacher. 4 billion attempts are not too much...

[penguinkeeper]

Included with this message is a mask file that can be used to brute force for every possible IP