Misplaced Pages

Rainbow table

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by 202.56.233.131 (talk) at 00:52, 27 August 2005 (Defense against Rainbow Tables). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 00:52, 27 August 2005 by 202.56.233.131 (talk) (Defense against Rainbow Tables)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Rainbow Tables

A rainbow table is a one-way hash cracking method created by Philippe Oechslin that uses a faster time-memory trade-off technique . Lists of hashed passwords are pre-generated into files with a utility (rtgen) that allows for hashes to be cracked in a short period of time, generally less than a minute. Tables are hash specific, e.g. MD5 tables can only crack MD5 hashes.


External Links

Stub icon

This computing article is a stub. You can help Misplaced Pages by expanding it.

Category: