Basics of Cryptology – Part 15 (Modern Cryptanalysis – Rainbow Tables)

Показать описание

#cryptology, #cryptography, #cryptanalysis, #lecture, #course, #tutorial

In this video, we show the basics of cryptology (cryptology = cryptography and cryptanalysis).

This video here gives an introduction to rainbow tables. Rainbow tables are data structures for the efficient search of pre-images of cryptographic hash functions. We show how rainbow tables are generated and how to search in rainbow tables (e.g. for a password).

Рекомендации по теме

Комментарии

It was frustratingly hard to find a good explanation of rainbow tables and how they work. This is by far the best one.

oldmate

There are two questions popping up in my mind, watching this video. 1. Shouldn't the chains, shown in the table, end on a hashvalue? I mean an unhashed reduction term in the last cell wont tell me anything about its hash value, or am I miss something?
2. The algorithmic description implies that a given hash h, for which I am searching a preimage, will directly be reduced and hashed. Then a search is conducted. Shouldn't the algorithm start with searching for the original hash h in the last column? By reducing and hash immediately I reduce my effective table size by 1 column i guess.
Anyway an excellent video, I think i got the idea of rainbow tables.
Cheers!

MsInternetz

Hello i have a question. How do you know what Reduction function to use in the first step??
For instance in the example you use the R2 because we could see it but in general how to know from where to start?

dimxr

First you tell that there are many reduction functions (R1, R2, R3 in your example), but then when you describe an algorithm of finding the pre-image, you do not explain which reduction function is used, which makes it very confusing. I would guess that we should compute R3("kolscx"), R3(H(R2("kolscx"))) and

iljasirosh

Basics of Cryptology – Part 15 (Modern Cryptanalysis – Rainbow Tables)

Basics of Cryptology – Part 1 (Cryptography – Terminology & Classical Ciphers)

Basics of Cryptology – Part 18 (Cryptography – Random Number Generators)

Basics of Cryptology – Part 2 (Cryptanalysis – Terminology & Classical Ciphers)

Basics of Cryptology – Part 15 (Modern Cryptanalysis – Rainbow Tables)

Basics of Cryptology – Part 23 (Cryptography – Modern Hybrid Encryption)

Basics of Cryptology – Part 7 (Modern Cryptography – Perfect Ciphers and One-Time Pad)

Basics of Cryptology – Part 14 (Modern Cryptography – Passwords)

Basics of Cryptology – Part 25 (Cryptography – Block Cipher Padding)

Basics of Cryptology – Part 20 (Cryptanalysis – Cost & Fitness Functions - Language Models)

Basics of Cryptology – Part 24 (Cryptography – Block Cipher Modes of Operation)

Basics of Cryptology – Part 5 (Modern Cryptography – Stream Ciphers – RC4)

Basics of Cryptology – Part 10 (Modern Cryptanalysis of Classical Ciphers – Genetic Algorithm)

Basics of Cryptology – Part 19 (Cryptanalysis – Unicity Distance & Check and Proof Cipher Soluti...

Basics of Cryptology – Part 22 (Cryptography – Kerckhoffs' Principle & Modern Cryptographic...

7 Cryptography Concepts EVERY Developer Should Know

Basics of Cryptology – Part 12 (Modern Asymmetric Cryptography – Diffie-Hellman Key Exchange)

Basics of Cryptology – Part 16 (Modern Cryptography – The Avalanche Effect)

Basics of Cryptology – Part 4 (Modern Cryptanalysis – Shannon's Entropy and Brute-Force Attack)...

The Science of Codes: An Intro to Cryptography

Basics of Cryptology – Part 21 (Cryptanalysis – The Index of Coincidence (IoC))

Basics of Cryptology – Part 8 (Modern Cryptanalysis of Classical Ciphers – Hill Climbing)

Cryptography 101 - The Basics

Basics of Cryptology – Part 13 (Modern Cryptography – Cryptographic Hash Functions)

Basics of Cryptology – Part 17 (Cryptography/Cryptanalysis – Keyspace and Keyspace Size)