| Title: | a universal distributed model for password cracking |
| Author: | Zou Jing
; Lin Dong-Dai
; Mi Guo-Cui
|
| Source: | Proceedings - International Conference on Machine Learning and Cybernetics
|
| Conference Name: | 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
|
| Conference Date: | July 10, 2
|
| Issued Date: | 2011
|
| Conference Place: | Guilin, Guangxi, China
|
| Keyword: | Hash functions
; Learning systems
|
| Indexed Type: | EI
|
| ISSN: | 2160-133X
|
| ISBN: | 9781457703065
|
| Department: | (1) SKLOIS Lab. Institute of Software Chinese Academy of Sciences China; (2) Graduate School Chinese Academy of Sciences Beijing 100080 China; (3) Huaiyin Normal University Huai'an China
|
| Sponsorship: | Hebei University; IEEE Systems, Man and Cybernetics Society; Chongqing University; South China University of Technology; Hong Kong Baptist University
|
| Abstract: | Due to the parallel nature of brute force attack, it is well suited to use parallel or distributed computing to recover passwords encrypted by one-way hash functions. When distributing the password cracking task between threads or nodes, it is necessary to divide the search space into several subspaces. It is ideal that the size of these subspaces is the same for a load balanced solution. However, increasing the length of passwords will raise the number of combinations exponentially. This will raises issues for the search space uniform partition. This paper presents a universal distributed model for password cracking capable of dividing the search space evenly. For this, the paper addresses the definition of a base-n-like number, and discusses operations on it and relations with base-n number. The model is data independent, easily implemented and needs a few of communications. Experimental results are then shown. © 2011 IEEE. |
| English Abstract: | Due to the parallel nature of brute force attack, it is well suited to use parallel or distributed computing to recover passwords encrypted by one-way hash functions. When distributing the password cracking task between threads or nodes, it is necessary to divide the search space into several subspaces. It is ideal that the size of these subspaces is the same for a load balanced solution. However, increasing the length of passwords will raise the number of combinations exponentially. This will raises issues for the search space uniform partition. This paper presents a universal distributed model for password cracking capable of dividing the search space evenly. For this, the paper addresses the definition of a base-n-like number, and discusses operations on it and relations with base-n number. The model is data independent, easily implemented and needs a few of communications. Experimental results are then shown. © 2011 IEEE. |
| Language: | 英语
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/16213
|
| Appears in Collections: | 软件所图书馆_会议论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
Zou Jing,Lin Dong-Dai,Mi Guo-Cui. a universal distributed model for password cracking[C]. 见:2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. Guilin, Guangxi, China. July 10, 2.
|
|
|
