Browse Definitions :
Definition

rainbow table

Contributor(s): Matthew Haughn

A rainbow table is a listing of all possible plaintext permutations of encrypted passwords specific to a given hash algorithm.

Rainbow tables are often used by password cracking software for network security attacks. All computer systems that require password-based authentication store databases of passwords associated with user accounts, typically encrypted rather than plaintext as a security measure.  

Once an attacker gains access to a system’s password database, the password cracker compares the rainbow table’s precompiled list of potential hashes to hashed passwords in the database. The rainbow table associates plaintext possibilities with each of those hashes, which the attacker can then exploit to access the network as an authenticated user.

Rainbow tables make password cracking much faster than earlier methods, such as brute-force cracking and dictionary attacks. Depending on the particular software, rainbow tables can be used to crack 14-character alphanumeric passwords in about 160 seconds. However the approach uses a lot of RAM due to the large amount of data in such a table.

Rainbow tables have only become viable recently because the amount of available RAM in older computers was inadequate. A single rainbow table for a standard alphanumeric file is close to 4 gigabytes (GB). Adding symbols to the mix increases the amount of memory required, as does each step up in encryption.

To protect against attacks using rainbow tables, system administrators should add security measures to password encryption, such as the addition of randomly generated  characters (salt) to password hashes and avoiding the use of outdated password hashing algorithms.

This was last updated in January 2015

Continue Reading About rainbow table

Join the conversation

1 comment

Send me notifications when other members comment.

Please create a username to comment.

The basis of rainbow tables is a reduction function that generates chains (containing starting and ending index values only) that are stored in a table. It is NOT a pre-computation of all possible plaintext to hash values...hence why rainbow tables are considered a time-memory trade-off problem to cracking hashes. Please look at Philippe Oechslin's paper on this topic.
Cancel

-ADS BY GOOGLE

File Extensions and File Formats

SearchCompliance

SearchSecurity

SearchHealthIT

SearchDisasterRecovery

  • business continuity plan (BCP)

    A business continuity plan (BCP) is a document that consists of the critical information an organization needs to continue ...

  • disaster recovery team

    A disaster recovery team is a group of individuals focused on planning, implementing, maintaining, auditing and testing an ...

  • cloud insurance

    Cloud insurance is any type of financial or data protection obtained by a cloud service provider. 

SearchStorage

  • RAID 6 (redundant array of independent disks)

    RAID 6, also known as double-parity RAID, uses two parity stripes on each disk. It allows for two disk failures within the RAID ...

  • hard disk drive (HDD)

    A computer hard disk drive (HDD) is a non-volatile memory hardware device that controls the positioning, reading and writing of ...

  • byte

    In most computer systems, a byte is a unit of data that is eight binary digits long. Bytes are often used to represent a ...

Close