Rainbow table

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

A new secure password authentication scheme using smart cards

Abstract: Thirteen security requirements for an ideal password authentication scheme using smart cards are listed and a new smart card based password authentication scheme with identity anonymity is proposed. The new scheme can satisfy all the listed ideal security requirements and has the following merits: ① it can resist all the attacks listed in introduction; ② less storage memory requirement due to no verification table stored in server; ③ low computational cost due to hash functions based operations; ④ even if the smart card is lost, the new system is still secure; ⑤ As user identity is anonymous, this scheme is more practical. The new proposed scheme can be applied in source constraint networks.

A Comparison of Cryptanalytic Tradeoff Algorithms.

Abstract: T hree time memory tradeoff algorithms are compared in this paper. Specifically, the classical tradeoff algorithm by Hellman, the distinguished point tradeoff method, and the rainbow table method, in their non-perfect table versions, are treated. We show that, under parameters and assumptions that are typically considered in theo- retic discussions of the tradeoff algorithms, Hellman and distinguished point tradeoffs per- form very close to each other and that the rainbow table method performs somewhat better than the other two algorithms. Our method of comparison can easily be applied to other situations, where the conclusions could be different. The analysis of tradeoff efficiency presented in this paper does not ignore the effects of false alarms and also covers techniques for reducing storage, such as ending point trun- cations and index tables. Our comparison of algorithms takes the success probabilities and pre-computation efforts fully into account.

Using Improved d-HMAC for Password Storage

Abstract: Password storage is one of the most important cryptographic topics through the time. Different systems use distinct ways of password storage. In this paper, we developed a new algorithm of password storage using dynamic Key-Hashed Message Authentication Code function (d-HMAC). The developed improved algorithm is resistant to the dictionary attack and brute-force attack, as well as to the rainbow table attack. This objective is achieved by using dynamic values of dynamic inner padding d-ipad, dynamic outer padding d-opad and user’s public key as a seed.

A Survey of Hash Tables with Summaries for IP Lookup Applications

Abstract: Efficient IPv6 packet forwarding is still a major bottleneck in todays networks. Especially in the internet core we are faced with very large routing tables and a high number of high-speed links. In addition economical restrains exist in terms of manufacturing and operation costs. So demand is high for efficient IPv6 packet forwarding mechanisms. In the last few years a lot of work has been done on hash tables and summaries that allow compact representations and constant lookup time. The features sound attractive for IPv6 routing, thus a survey and evaluation of these data structures seems appropriate.

A Quick Tables Look-up Algorithm based on Hash Query for CAVLC Decoding

Abstract: Aiming to solve the problem of long table look-up time in table look-up of CAVLC (Context-based Adaptive Variable Length Coding) for H.264/ AVC, a quick table look-up algorithm based on hash query (TLHQ) is proposed to reduce table look-up time for CAVLC decoding in this paper. The basic idea of the new algorithm is that it uses query technology of hash table to rapidly determine code length based on the number of zero in code prefix, As a result, it can save a lot of time of table looking-up and code judging. Experimental results show that our supposed new algorithm could reduce about 20% table look-up time and save 1056 byte storage space for CAVLC decoding in H.264/AVC.