Category Archives: Rainbow Tables

This is Part 5 of a five part series: Introduction Encryption and Hashes Simple Hashes and Collisions Reduction Functions Rainbow Tables and Chains (you are here) Addendum So – here we go!  Let’s look at rainbow tables! Here is a sample lookup table for a very simplistic encryption algorithm (discussed in Part 2) that takesContinue reading “Rainbow Tables – Part 5 (Chains and Rainbow Tables)”

This is Part 4 of a five part series: Introduction Encryption and Hashes Simple Hashes and Collisions Reduction Functions (you are here) Rainbow Tables and Chains Addendum Reduction functions are at the heart of how rainbow tables work. To understand reduction functions, lets look at a set of two-digit values that are “encrypted” into four-digitContinue reading “Rainbow Tables – Part 4 (Reduction Functions)”

This is Part 3 of a five part series: Introduction Encryption and Hashes Simple Hashes and Collisions (you are here) Reduction Functions Rainbow Tables and Chains Addendum Geoff Kuenning, a computer science professor at Harvey Mudd College, has a great web page about hashes as a part of one of his classes.  Let’s look atContinue reading “Rainbow Tables – Part 3 (Simple Hashes and Collisions)”

This is Part 2 of a five part series: Introduction Encryption and Hashes (you are here) Simple Hashes and Collisions Reduction Functions Rainbow Tables and Chains Addendum As I mentioned in the first post of this series, rainbow tables are used to find a password if you know the encrypted password. Passwords typically are (orContinue reading “Rainbow Tables – Part 2 (Encryption and Hashes)”

This is Part 1 of a five part series: Introduction (you are here) Encryption and Hashes Simple Hashes and Collisions Reduction Functions Rainbow Tables and Chains Addendum In January, I took the SANS Security Essentials (401) class at SANS West.  In the class, we briefly covered the concept of rainbow tables. Rainbow tables are (superficially)Continue reading “Rainbow Tables – Part 1 (Introduction)”