Collaborate Disseminate
Suppose I have a database containing hashes. Hashes are obtained from password developed from randomly chosen set of 94 characters such that each password size is of 8 characters. So we have 94^8 passwords. Each of the passw… Continue reading Calculating Time for a Attack on Password Hashes [on hold]
Can someone tell me the what length passwords have been hashed, in every possible combination, in rainbow tables? In MD5 and SHA1. Including all characters (letters upper and lower case, numbers and symbols). In other word… Continue reading Rainbow tables (MD5 and SHA-1) with all 8 char combinations [on hold]
I have a database table with accounts. I’m using PBKDF2 to create hashes from passwords. The passwords are of the correcthorsebatterystaple type, so we assume they are secure and unique. There are no usernames, so I need to b… Continue reading Protect key-streched hashes from rainbow tables?
I understand that using a salt makes it harder to find cleartext using rainbow tables – but in that scenario the clear text is structured / low entropy. If my clear text is generated randomly, then is there any benefit to usi… Continue reading Is there any benefit to using a salt when the cleartext is random data?
Scenario:
1000 distinct keys are each prefixed with the same salt, and SHA1 hashed. The hash output is then iteratively SHA1 hashed x times. Let’s start with x is 100.
The specification of the keys is 10 chars length exactly… Continue reading Iterated SHA1 hashing and the effect on rainbow table computation
Two reduction function in a rainbow-table are known to me:
one = i H(P1) = X1, remove X1 remove all the value only left first few number
Two – x mod N, mod method
or use both, but if using both which would be the first to … Continue reading Which rainbow-table reduction function is best or should we use both?
To be sure I well understood the Rainbow Tables, I’ve decided to make a little project in Java, but I”m stuck on a question : how to choose the size of the chain ? And this will give the number of lines to get a good percenta… Continue reading To build a rainbow table, how to decide size of chain and number of lines?
This is more of a theoretical rather than a practical question. To give a bit of background, the discussion at work has come up with what to set our password complexity to and what the logistics would be if a DB was stolen (for this situat… Continue reading Cracking passwords via hashcat or rainbow tables. Which is faster?
What is a good plaintext function for the chain begin in a rainbow table? Is it useful to generate the begin plaintext randomly or is there any scheme that is common?
Continue reading What plaintext should I use as chain begin in a rainbow table?
I understand how Hellman’s time-memory trade-off tables work by creating chains of hash and reduction function results and storing the last result after a number of operations. since the reduction function maps from hash spac… Continue reading clarification on how rainbow tables use multiple reduction functions to avoid collisions