Institutional Repository
| Making a higher hit ratio cryptanalytic time-memory trade-off attack on passwords | |
| Zou, Jing (1); Lin, Dongdai (1); Hao, Chunhui (2); Li, Zhenqi (2); Wang, Wenhao (1); Lu, Yao (1) | |
| 2013 | |
| Source | Chinese Journal of Electronics
 |
| ISSN | 10224653 |
| Volume | 22Issue:4Pages:671-676 |
| English Abstract | Most of implementations of the cryptanalytic time-memory trade-off attacks such as Hellman's original method, Rivest's distinguished points cracking and Oechslin's rainbow attack are also considered as an exhaustive attack to passwords in a limited length range on a certain charset. However, 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 ratio 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.; Most of implementations of the cryptanalytic time-memory trade-off attacks such as Hellman's original method, Rivest's distinguished points cracking and Oechslin's rainbow attack are also considered as an exhaustive attack to passwords in a limited length range on a certain charset. However, 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 ratio 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. |
| Indexed Type | SCI ; EI |
| Keyword | Time-memory Trade-off Cryptanalysis High Hit Ratio |
| Department | (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 |
| Language | 英语 |
| WOS ID | WOS:000326666600004 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16910 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zou, Jing ,Lin, Dongdai ,Hao, Chunhui ,et al. Making a higher hit ratio cryptanalytic time-memory trade-off attack on passwords[J]. Chinese Journal of Electronics,2013,22(4):671-676. |
| APA | Zou, Jing ,Lin, Dongdai ,Hao, Chunhui ,Li, Zhenqi ,Wang, Wenhao ,&Lu, Yao .(2013).Making a higher hit ratio cryptanalytic time-memory trade-off attack on passwords.Chinese Journal of Electronics,22(4),671-676. |
| MLA | Zou, Jing ,et al."Making a higher hit ratio cryptanalytic time-memory trade-off attack on passwords".Chinese Journal of Electronics 22.4(2013):671-676. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment