Alphabet Soup: Haskell’s Single-Letter Naming Quirks

When you used punch cards or tape to write a computer program, brief variable names were the norm. Your compiler or assembler probably only allowed six letters, anyway. But times …read more Continue reading Alphabet Soup: Haskell’s Single-Letter Naming Quirks

What’s the most simple approach to this wordlist generation and ruleset problem?

This is a password recovery project, which is more complex than just generated a wordlist, since using my tries (see below) it seems to be not enough to just generate a wordlist.
I’m trying to recover my old Bitcoin wallet, which I created… Continue reading What’s the most simple approach to this wordlist generation and ruleset problem?

Windows AD – Fake User Account with Multiple Passwords to Detect Password Spray

TL;DR
I’m trying to implement a fake user account that has multiple sets of credentials that can be used. Instead of a specific password, any one password from a list of them could be used to authenticate to the account. By doing so, we c… Continue reading Windows AD – Fake User Account with Multiple Passwords to Detect Password Spray

How to crack KeePass database when knowing the first part of the master password [duplicate]

I have a KeePass 2.47 database which is protected with a master password and a key file.
I managed to lose the 2nd part of my master password. So, I have access to the database, the key file and the first part of the master password (ftyhb… Continue reading How to crack KeePass database when knowing the first part of the master password [duplicate]

Creating wordlist with no more than 2 repeating characters [migrated]

I’m creating a wordlist with uppercase letters A-Z and numbers 0-9. The length is exactly 8 characters long. Using the tool crunch, preinstalled in Kali, I was able to generate a wordlist that doesn’t contain any consecutive characters, fo… Continue reading Creating wordlist with no more than 2 repeating characters [migrated]

How long would it take to crack hashed password stored in plain sight?

I want to store a password hash in plain sight. If I am using a dictionary to crack an Argon2 hashed password that I am storing in plain sight, how long would it take (assuming my password is reasonably complex)? Further, are there any oth… Continue reading How long would it take to crack hashed password stored in plain sight?

python script output is not generating the world list the right way

words = [‘cyse’, ‘gmu’, ‘mason’, ’20’, ’21’, ’22’, ’23’, ’24’ ]

cases = []
for word in words:
pr = product(*zip(word, word.upper()))
cases += [set(map(”.join, pr))]

for perm in permutations(cases):
for prod in product(*per… Continue reading python script output is not generating the world list the right way