A novel time-memory trade-off method for password recovery
TLDR
A new time-memory trade-off method is shown to be able to achieve up to a 50% reduction in terms of the storage requirement in comparison to the well-known rainbow table method, and to demonstrate a significant increase in the success rate of recovery when taking into consideration the effect of collisions.About:
This article is published in Digital Investigation.The article was published on 2009-09-01 and is currently open access. It has received 20 citations till now. The article focuses on the topics: Password strength & Password.read more
Citations
More filters
Journal ArticleDOI
Improving Password Memorability, While Not Inconveniencing the User
Naomi Woods,Mikko T. Siponen +1 more
TL;DR: It is found that through increasing the number of verifications did not equate to a decrease in user convenience, which means that small changes to the password verification stage can have significant results on password memorability while not necessarily inconveniencing the user.
Journal ArticleDOI
A survey exploring open source Intelligence for smarter password cracking
TL;DR: The potential for Open Source Intelligence (OSINT) being leveraged for more efficient password cracking is explored and the potential impact of OSINT to password cracking by law enforcement is discussed.
Journal ArticleDOI
Comparison of perfect table cryptanalytic tradeoff algorithms
Ga-Won Lee,Jin Hong +1 more
TL;DR: In this article, the authors compared the performance of three major time memory tradeoff algorithms: the Hellman tradeoff, the non-perfect table versions of the distinguished point method and the rainbow table method.
A Novel Rainbow Table Sorting Method
TL;DR: An improved password sorting method that supports a quick binary search instead of the slower linear search as employed in the enhanced rainbow table and will result in a 23% reduction in storage requirement, compared to the original rainbow tables, while maintaining the same success rate.
References
More filters
Proceedings Article
The MD5 Message-Digest Algorithm
TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Book
Cryptography and data security
TL;DR: The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.
Journal ArticleDOI
A cryptanalytic time-memory trade-off
TL;DR: A probabilistic method is presented which cryptanalyzes any N key cryptosystem in N 2/3 operational with N2/3 words of memory after a precomputation which requires N operations, and works in a chosen plaintext attack and can also be used in a ciphertext-only attack.