scispace - formally typeset
Search or ask a question
Topic

Rainbow table

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


Papers
More filters
01 Jan 2015
TL;DR: This project examines the nature of password cracking and modern applications, including dictionary attack, brute force, and rainbow tables, and an implementation of two hash-based password cracking algorithms are developed.
Abstract: This project examines the nature of password cracking and modern applications. Several applications for different platforms are studied. Different methods of cracking are explained, including dictionary attack, brute force, and rainbow tables. Password cracking across different mediums is examined. Hashing and how it affects password cracking is discussed. An implementation of two hash-based password cracking algorithms is developed, along with experimental results of their efficiency.

3 citations

Proceedings ArticleDOI
21 Nov 2009
TL;DR: The results of simulation demonstrated the improvement of the proposal in both accessing delay and searching hops compared to distributed hash table, and presented corresponding data accessing methods.
Abstract: It generally utilized either peer-to-peer overlay network or server clusters to offer wide area network storage service. These network storage systems suffered from performance penalties or single-point failure. This paper proposed a network storage structure which combines regular graph with distributed hash table, and presented corresponding data accessing methods. The results of simulation demonstrated the improvement of the proposal in both accessing delay and searching hops compared to distributed hash table.

3 citations

01 Jan 2008
TL;DR: A new memory consumption oriented way for comparing the significantly different approaches and analyses various types of hash table implementations to answer the question what structure needs to be used and how the parameters must be chosen in order to achieve a maximal lookup performance with the lowest possible memory consumption.
Abstract: Hash tables can provide fast mapping between keys and values even for voluminous data sets. Our main goal is to find a suitable implementation having compact structure and efficient collision avoidance method. Our attention is focused on maximizing the lookup performance when handling several millions of data items. This paper suggest a new memory consumption oriented way for comparing the significantly different approaches and analyses various types of hash table implementations in order to answer the question what structure needs to be used and how the parameters must be chosen in order to achieve a maximal lookup performance with the lowest possible memory consumption.

3 citations

05 Nov 2015
TL;DR: This document describes the Argon2 memory-hard function for password hashing and other applications together with sample code and test vectors to simplify adoption of Argon2 for Internet protocols.
Abstract: This document describes the Argon2 memory-hard function for password hashing and other applications. We provide a implementer oriented description together with sample code and test vectors. The purpose is to simplify adoption of Argon2 for Internet protocols.

3 citations

Patent
29 Mar 2017
TL;DR: In this paper, a plaintext character string is acquired, and the ciphertext character strings contained in the encryption result are not complete ciphertext characters, but the incomplete intercepted character strings, and therefore, the encryption method can assist in effectively preventing the encryption results from being subjected to collision attack, violent attack or rainbow table comparison attack compared with an encryption method according to which a single encryption algorithm is adopted to perform encryption to obtain complete cipher text character strings.
Abstract: The present invention provides an encryption method and apparatus The objective of the invention is to solve the problem that an encryption mode in the prior art may reduce the security of stored standard passwords The method includes the following steps that: a plaintext character string is acquired; the acquired plaintext character string is encrypted through adopting at least two kinds of encryption algorithms, so that at least two corresponding ciphertext character strings can be obtained; characters are intercepted from each kind of obtained ciphertext character strings; and the encryption result of encryption performed on the plaintext character string can be obtained according to the intercepted characters The encryption result obtained by using the above method contains the ciphertext character strings obtained after the encryption is performed with the different encryption algorithms, and the ciphertext character strings contained in the encryption result are not complete ciphertext character strings, but the incomplete intercepted character strings, and therefore, the encryption method can assist in effectively preventing the encryption result from being subjected to collision attack, violent attack or rainbow table comparison attack compared with an encryption method according to which a single encryption algorithm is adopted to perform encryption to obtain complete ciphertext character strings, and therefore, the security of the encryption result can be improved

3 citations


Network Information
Related Topics (5)
Cryptography
37.3K papers, 854.5K citations
84% related
Encryption
98.3K papers, 1.4M citations
82% related
Public-key cryptography
27.2K papers, 547.7K citations
82% related
Authentication
74.7K papers, 867.1K citations
79% related
Key (cryptography)
60.1K papers, 659.3K citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20215
20206
201911
201810
201729
201630