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) |
| 刊名 | Chinese Journal of Electronics
 |
| 出版日期 | 2013 |
| 卷号 | 22期号:4页码:671-676 |
| ISSN号 | 10224653 |
| 关键词 | Time-memory trade-off Cryptanalysis High hit ratio |
| 中文摘要 | 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. |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000326666600004 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16910]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。