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 published on a yearly basis
Papers
More filters
TL;DR: This paper proposed a new method which can crack DES password quickly with less power consumption on a coarse grain reconfigurable architecture (CGRA) named reconfigured encrypt-decrypt system (REEDS).
Abstract: Rainbow attack is a very efficient attack which uses rainbow tables to offer an almost optimal time-memory tradeoff in the process of recovering the plaintext password from ciphertext hash. In this paper, we proposed a new method which can crack DES password quickly with less power consumption on a coarse grain reconfigurable architecture (CGRA) named reconfigurable encrypt-decrypt system (REEDS). To the best of our knowledge, this is the first try for password cracking based on “Rainbow Tables” under a dynamically CGRA platform presented in the literature. High parallel computing capability and good flexibility make the platform an excellent candidate to process multimedia application, encryption and decryption algorithm etc. In this paper, the whole work of DES password cracking based on rainbow tables is split into several sub tasks, which are mapped onto REEDS respectively and executed in parallel using pipeline approach. Experimental results show that the proposed system with 200 MHz clock r...
07 Sep 2010
TL;DR: The new concepts of password security based on text-based authentication, ensuring the security from dictionary attacks are looked at, based on the principle of conversion of the characters of password in some control points, an unrecognizable form for intruders.
Abstract: Password security has emerged as a promising field in the Computer science and technology. The innovative strategies are found to be costly and also require expertise to use them. The widely used methods of password security are pass-faces and biometrics password authentication schemes. Though they serve their purpose but are found to be cost ineffective.This paper looks at the new concepts of password security based on text-based authentication, ensuring the security from dictionary attacks. It is based on the principle of conversion of the characters of password in some control points, an unrecognizable form for intruders.
Dissertation•
01 Jan 2016
01 Dec 2013
TL;DR: A hash function based on Pearson hashing is proposed which can effectively reduce the collision rate and thus improve the performance of LUT by adding a dynamically generated permutation table and it is demonstrated the LUT performance can be significantly improved from very low additional cost.
Abstract: While lookup table (LUT) is widely used in virtually every kind of computing devices, to achieve low access latency with low cost is always challenging. Although Content-Addressable Memory (CAM) can be used to implement LUT, it is not very cost-effective to add such an expensive device dedicated for LUT in most cases. On the other hand, using hash functions to implement LUT, which can achieve O(1) fast lookup in most cases without special hardware, is more preferable. The performance of a hash table based LUT depends on the collision rate. In this paper, we propose a hash function based on Pearson hashing which can effectively reduce the collision rate and thus improve the performance of LUT by adding a dynamically generated permutation table. We demonstrate the LUT performance can be significantly improved from very low additional cost.