Making a Higher Hit Ratio Cryptanalytic Time-Memory Trade-Off Attack on Passwords  

作　　者：ZOU JingI LIN Dongdai HAO Chunhui LI Zhenqi WANG Wenhao LU Yao 

机构地区：[1]State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China [2]Graduate University of Chinese Academy of Sciences, Beijing 100190, China [3]Huaiyin Normal University, Huai ' an 223300, China [4]Laboratory of Complex Systems and Intelligence Science, Institute Automation, Chinese Academy of Sciences, Beijing 100190, China [5]Institute of Software, Chinese Academy of Sciences, Beijing 100190, China

出　　处：《Chinese Journal of Electronics》2013年第4期671-676,共6页电子学报（英文版）

基　　金：This work is supported by the National Basic Research Program of China （973 Program） （No.2011CBC302400）, the National Natural Science Foundation of China （No.60970152）, and the Young Teacher＇s Fund Project of Huaiyin Normal University （No.07HSQN020）.

摘　　要：Most of implementations of the cryptana- lyric time-memory trade-off attacks such as Hellman＇s orig- inal method, Rivest＇s distinguished points cracking and Oechslin＇s rainbow attack are also considered as an ex- haustive attack to passwords in a limited length range on a certain charset. However＇s the distributions of structures and strings making up real human memorable passwords do not appear random. Based upon these, we propose a method to generate passwords in those cryptanalytic time- memory trade-off methods. It achieves a higher hit ra- tio in attacking actual passwords and reduces search space drastically with requirement of only a little extra memory. It makes time-memory trade-off more practical. Even to attack long length passwords, the results of experiments show that our approach has a higher hit ratio compared with Oechslin＇s method. In addition, this method can be used in the distributed and parallel attack.

关 键 词：Time-memory trade-off CRYPTANALYSIS High hit ratio. 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TN918.1[自动化与计算机技术—控制科学与工程]