Questions tagged [rainbow-table]

A rainbow table allows inverting a cryptographic function (typically, a hash) at low cost, after a precomputation.

Filter by
Sorted by
Tagged with
0 votes
1 answer
26 views

About the differences between the rainbow table and hellman table

I'm learning the rainbow table and hellman table and I'm curious about the difference between them, so I left a question like this. Wikipedia describes the following sentence: The term, "Rainbow ...
user avatar
  • 89
1 vote
0 answers
43 views

Matching accounts across multiple data leaks via their hashed passwords

I've heard about several instances where OSINT researchers were able to match user accounts from multiple data leaks purely based on their hashed passwords, assuming accounts had the same password on ...
user avatar
  • 111
0 votes
2 answers
161 views

Is the linear and differential cryptanalysis only dependent on Sbox?

While performing the linear and differential cryptanalysis a Linear Approximation Table(LAT) and a Different Distribution Table(DDT) is required which is created exploiting the S-box of the cipher ...
user avatar
  • 157
1 vote
1 answer
62 views

Is there a point in storing hash or plaintext in the last column of Rainbow Tables

As I read up on rainbow tables, I found that most sources suggest storing a plaintext - the result of Rk(hk) - in the last column, while others just store the hash hk, basically stopping one step ...
user avatar
  • 113
0 votes
0 answers
364 views

Reduction function Generation

I think I know how rainbow table works , I just wanted to make basic reduction function(for md5) in python with an approach that I am not taking a certain portion of hash but am taking the full hash ...
user avatar
2 votes
2 answers
459 views

How to prove that a rainbow table is complete?

Passwords that are hashed but not salted can be cracked using the rainbow table. I went through this and this which explains the logic behind rainbow table very well. But I am missing something about ...
user avatar
  • 143
0 votes
1 answer
810 views

Having trouble understanding reduction functions in rainbow tables

I'm continuing doing some personal research on rainbow tables, but forsome reason I cannot understand how to choose the correct reduction function. Wikipedia states that "Only when the attacker has ...
user avatar
0 votes
1 answer
162 views

Capital passphrases with rainbow tables?

I'm currently trying to learn how rainbow tables work for a personal project of mine, but I am a little bit confused on how passphrases can be found. Here are the steps that seem do this, from the ...
user avatar
3 votes
5 answers
2k views

How does a salt get chosen?

I feel like I am missing some information regarding salting. How does one choose the salt? If you reuse the same salt for all passwords, can it just be figured out and then used in conjunction with ...
user avatar
  • 31
6 votes
4 answers
3k views

Are rainbow tables still useful?

With unsalted passwords becoming rare, and stream ciphers having a significantly large state, are there currently any widely deployed systems still vulnerable to such time-memory-data trade-off ...
user avatar
  • 10.4k
-2 votes
1 answer
204 views

Secure password storing mechanism [closed]

I recently thought about a secure password storing mechanism. I wanted to ask if the following password storing mechanism is resistant against rainbow tables with a secure password and the attacker ...
user avatar
  • 105
2 votes
2 answers
1k views

Multiple Rainbow Tables and their Success Probability

I am trying to understand the calculations for the success probability of finding an unknown key using rainbow tables. Basically, I have a target success probability, a known keyspace of size $N$ and ...
user avatar
  • 25
3 votes
1 answer
278 views

Given a sha-512 hash of a value picked at random from the $2^{128}$ key space, how hard would it be to recover the original value?

More specifically is it reasonable to assume that someone with the resources of a state actor can feasibly compute a rainbow table of all the sha-512 hashes of values within the $2^{128}$ key space? ...
user avatar
0 votes
1 answer
255 views

Using rainbow tables to find encryption keys of block ciphers?

Hi I have a question in mind. Let's consider a block cipher whose key length is 36 bits. The bit-length of the plaintext is 256 bits, but there are only 16 possible plaintexts $m_0, m_1, . . . , ...
user avatar
6 votes
1 answer
6k views

How to create reduction functions in rainbow tables?

I have been trying to understand rainbow tables lately and one part is giving me trouble to understand here. Let's say I want to generate a table where the chains are 100 000 hash/plaintext long. I ...
user avatar
  • 163
1 vote
2 answers
604 views

Time complexity of looking up in a rainbow table

It is mentioned in the famous paper Making a Faster Cryptanalytic Time-Memory Trade-Off (pdf) by Philippe Oechslin that: The total number of calculations we have to make is thus $\frac{t(t−1)}{2}$...
user avatar
4 votes
1 answer
161 views

Which values to store in rainbow table generation?

According to the Wikipedia and Philippe Oechslin's Making a Faster Cryptanalytic Time-Memory Trade-Off (pdf), both starting points and endpoints are keys. Here is an example from Wikipedia: As you ...
user avatar
2 votes
0 answers
47 views

Are the prime numbers used for RSA encryption known? [duplicate]

I read that one reason why RSA is secure is because it uses a huge number that's called the modulus which is the product of two prime numbers. For maths reasons the prime numbers being prime numbers ...
user avatar
  • 121
3 votes
1 answer
838 views

Rainbow Table - Number of Chains and Chain Length

Is there a difference between having 10,000 of chains (with 1,000 chain length) and 10,000 chain length (with 1,000 of chains)? How does it affect the success rate of the rainbow table? I understand ...
user avatar
  • 31
6 votes
2 answers
17k views

Is this SHA256 hash implementation secure from rainbow table, brute forcing attacks?

So I have an implementation where by we have an $8$-byte random input (entirely random, not user defined) which we hash with $\text{SHA256}$. The hash is shared with many parties to the point that we ...
user avatar
  • 161
4 votes
1 answer
3k views

How to choose the reduction function in rainbow tables?

I have a question regarding Reduction Functions in Rainbow Tables. If the hashing function is MD5 or SHA-1 etc then should the reduction functions also be MD5 or SHA-1? That is, should the Reduction ...
user avatar
-4 votes
2 answers
1k views

Decrypting SHA-256 with SHA-256 as input?

Is there a way to somewhat decrypt a SHA-256 hash, provided that the initial string was also a SHA-256 hash? If not, could anyone link me to a rainbow table containing some of the $16^{64}$ possible ...
user avatar
  • 11
1 vote
1 answer
1k views

What effect does a salt have on attacks against hashes's fundamental properties?

I am interested in analyzing how adding a salt to our hashed passwords affects the three types of attacks we can use. The three types of attacks against hashes are as follows: We have the hashed ...
user avatar
2 votes
1 answer
2k views

What's the perfect chain length : number of chains ratio for rainbow tables?

I'm building a SHA-1 rainbow table to crack basic passwords (i.e. up to 10 character, 0-9,a-z), but I can't seem to calculate that golden ratio that would give me the most coverage. What ration of ...
user avatar
  • 23
1 vote
1 answer
57 views

Is hashing data with dynamic keys still worth effort?

some years ago it took long time to "decrypt" hashes because they took slow cpu to brute force. Nowadays they use graphic cards for stuff like this and can do this most time in less than 20 Minutes ...
user avatar
2 votes
1 answer
1k views

Construct rainbow table to break DES for a fixed plaintext

I'm facing a project where I need to build a rainbow table to break DES for a fixed plaintext. I've already collected information about Hellman, DP, rainbow table method. Finally, I chose the rainbow ...
user avatar
5 votes
1 answer
804 views

Are there any known inverse hash lookups for the zero string?

Just wondering, are there any known inverse hashes / hash lookups in common hashes (md5, sha1, sha2, etc.) for the zero string hash value? (i.e. bytes 0x00 00 00 00 00 ...) Or more specifically, for ...
user avatar
  • 187
0 votes
1 answer
77 views

Is there (this) a case in which salting is dispensable?

tl;dr this is not a duplicate of "what is a salt/why use salt?" question. Instead it is specificly asking when salt may not be necessary for hashing securly? (i.e. when the data being hashed is ...
user avatar
1 vote
2 answers
439 views

How to guarantee every plaintext is in a rainbow table?

This guide says that for a rainbow table or pre-computed hash chain, you can only get a probability that a plaintext is in a table, not a guarantee. Is there a way to guarantee every possible ...
user avatar
  • 435
2 votes
1 answer
534 views

Rainbow tables, where have I got it wrong?

There seems to be some error in my understanding of the concept of rainbow tables, despite going through quite a bit of articles on it. Let me show what I don't seem to agree with. My plain text is ...
user avatar
6 votes
3 answers
2k views

Rainbow table for DES with all-zero plaintext?

Consider the function $F$ from $\{0,1\}^{56}$ to $\{0,1\}^{64}$, mapping the operative bits of a DES key to the ciphertext for all-zero plaintext. How could we organize a rainbow table to invert that ...
user avatar
  • 122k
2 votes
1 answer
1k views

Rainbow tables and blowfish

I'm thinking of implementing rainbow tables for a specific blowfish problem, but I have trouble thinking of the proper way to apply the original paper (and its application to hash functions) to ...
user avatar
  • 176
2 votes
1 answer
248 views

Why must we hash lot of times in rainbow tables?

I don't get the utility to chain and reduce in generating rainbow tables. Hash functions are made to not have collisions, or at least chain only 2 times so we don't return to the concept of the hash ...
user avatar
2 votes
2 answers
2k views

Is rainbow table attack applicable to any hash?

Typically when rainbow tables are discussed MD5 hash is used as an example. It's not quite clear whether this attack is specific just to MD5 or to a certain subset of hashes or to just any hash ...
user avatar
3 votes
2 answers
2k views

How does using salt reduce rainbow table attack?

I could create a rainbow table for a particular salt value and still create a successful attack similar to one without salt value.
user avatar
11 votes
1 answer
18k views

Example Rainbow Table Generation

I have read up on rainbow tables and think I understand the idea behind them. However, I find that it would be better for me to actually attempt to implement a (very basic) rainbow table generator in ...
user avatar
2 votes
2 answers
422 views

Idea for user/pass hashing to prevent rainbow tables, would it work?

I'm very new to cryptography (and security in general, for that matter), but I had an idea that I'm sure is very flawed, but is worth asking. If a computer user, online account, etc, needs to verify a ...
user avatar
  • 171
15 votes
5 answers
5k views

How can rainbow tables be used for a dictionary attack?

I'm putting together a password policy for my company. I very much want to avoid requiring complex passwords, and would much rather require length. The maximum length I can enforce is 14 characters. ...
user avatar