Home // CYBERLAWS 2011, The Second International Conference on Technical and Legal Aspects of the e-Society // View article

A Novel Rainbow Table Sorting Method

Authors:
Hwei-Ming Ying
Vrizlynn L. L. Thing

Keywords: Digital forensics; password recovery; search optimization; time-memory tradeoff; cryptanalysis.

Abstract:
As users become increasingly aware of the need to adopt strong password, it also brings challenges to digital forensics investigators due to the password protection of potential evidence data. In this paper, we discuss existing password recovery methods and propose a new password sorting method that aid in improving the performance of the recovery process. This improved method supports a quick binary search instead of the slower linear search as employed in the enhanced rainbow table. We show that this method will result in a 23% reduction in storage requirement, compared to the original rainbow tables, while maintaining the same success rate. It is also an improvement over the enhanced rainbow table as the time taken for the password lookup will be drastically reduced.

Pages: 35 to 40

Copyright: Copyright (c) IARIA, 2011

Publication date: February 23, 2011

Published in: conference

ISBN: 978-1-61208-122-9

Location: Gosier, Guadeloupe, France

Dates: from February 23, 2011 to February 28, 2011