Showing papers on "Rainbow table published in 1970"
TL;DR: A new method of hash coding is presented and is shown to possess desirable attributes, and is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup.
Abstract: A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.
41 citations
TL;DR: A search method is presented which is computationally simple, has all the advantages of the quadratic search, and yet accesses all the table in one sweep.
Abstract: The quadratic residue search method for hash tables avoids much of the clustering experienced with a linear search method. The simple quadratic search only accesses half the table. It has been shown that when the length of the table is a prime of the form 4n + 3, where n is an integer, the whole table may be accessed by two quadratic searches plus a separate access for the original entry point. A search method is presented which is computationally simple, has all the advantages of the quadratic search, and yet accesses all the table in one sweep.
27 citations