中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
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:软件所图书馆_会议论文

Files in This Item:

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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zou Jing]'s Articles
[Lin Dong-Dai]'s Articles
[Mi Guo-Cui]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zou Jing]‘s Articles
[Lin Dong-Dai]‘s Articles
[Mi Guo-Cui]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2021  中国科学院软件研究所 - Feedback
Powered by CSpace