a universal distributed model for password cracking

ISCAS OpenIR

	a universal distributed model for password cracking
	Zou Jing; Lin Dong-Dai; Mi Guo-Cui
	2011
会议名称	2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
会议录名称	Proceedings - International Conference on Machine Learning and Cybernetics
页码	955-960
会议日期	July 10, 2
会议地点	Guilin, Guangxi, China
收录类别	EI
ISSN	2160-133X
ISBN	9781457703065
部门归属	(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
摘要	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.; 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.
关键词	Hash Functions Learning Systems
主办者	Hebei University; IEEE Systems, Man and Cybernetics Society; Chongqing University; South China University of Technology; Hong Kong Baptist University
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16213
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zou Jing,Lin Dong-Dai,Mi Guo-Cui. a universal distributed model for password cracking[C],2011:955-960.