Rainbow table

About: Rainbow table is a research topic. Over the lifetime, 488 publications have been published within this topic receiving 11528 citations.

A Lock-Free Concurrent Hash Table Design for Effective Information Storage and Retrieval on Large Data Sets.

Abstract: The purpose of this work is to develop a lock-free hash table that allows a large number of threads to concurrently insert, modify, or retrieve information. Lock-free or nonblocking designs alleviate the problems traditionally associated with lock-based designs, such as bottlenecks and thread safety. Using standard atomic operations provided by the hardware, the design is portable and therefore, applicable to embedded systems and supercomputers such as the Cray XMT. Real-world applications range from search-indexing to computer vision. Having written and tested the core functionality of the hash table, we plan to perform a formal validation using model checkers.

Using timing of character input to verify password

Abstract: A multi-dimensional approach can be used to verify a password. In addition to requiring the input of the correct password, the timing at which the characters of the password are input can be determined and compared to stored timing values. Even if the correct password is input, authentication can still fail if the characters of the password are not input in accordance with a required timing.

Authentication by Password Mistyping Correction

Abstract: A user interface (113) of an apparatus (110) receives (S02, S12) a password in a password space from a user; a processor (111) uses (S03, S13) canonicalization to obtain a representative form of the password, wherein the password space is partitioned into a plurality of partitions comprising at least one element, wherein one element of each partition is the representative form of the partition; the processor hashes the representative form of the password to obtain a hashed password and sends the hashed password to a server (120). The disclosure can provide resistance to typing errors in input passwords.

User password management method and server

Abstract: The embodiment of the invention provides a user password management method and a server, and relates to the field of computers. The method is as follows: through generating salt value extended information according to a salt value after receiving a user registration request comprising a user ID (Identification) and a password, and splicing the salt value and the salt value extended information into salt value information according to a preset sequence, after a password is encrypted, the user ID only needs to be associated with a second ciphertext after two times of encryption to store and thesalt value does not need to be stored; the problem that the server needs to consume a large number of storage spaces due to the fact that the salt value needs to be stored in the prior art is solved;and since the salt value does not need to be stored, an attacker is prevented from attacking and cracking the user password by stealing the salt value and constructing a rainbow table.

Multiple Input Based Passwords

Abstract: A computer-implemented method, carried out by one or more processors, for utilizing one or more input methods for passwords. In an embodiment, the method comprises the steps of determining, by one or more processors, one or more input methods supported for a password entry, wherein the password entry verifies a user's credentials; receiving, by one or more processors, a candidate password through the one or more input methods, wherein each character of the candidate password has an associated input method; and storing, by one or more processors, the candidate password as the password entry, along with the associated input method for each character of the candidate password.