期刊文献+

一种基于分段式宁符集的彩虹表明文生成方式

A Rainbow-Table Plain Generation Method based on Segmented Charset
下载PDF
导出
摘要 Oechslin提出的彩虹表应用时间空间折中思想,是密码学中逆转单向函数的有效工具,但现在广泛使用的单一字符集彩虹表,在明文位数较大时,因明文空间的迅速膨胀,消耗计算资源的迅速增加,其应用遇到了瓶颈。为此,针对人为口令字符集构成特点,提出分段式字符集彩虹表明文生成方式,将取自不同字符集的不同位数明文拼接组成新的明文,可以有效地压缩明文空间,增加覆盖的最大明文位数。对取自CSDN的1000个真实口令哈希进行实验,结果表明,在原始彩虹表的基础上,使用分段式字符集彩虹表使恢复成功率提升39.1%。 TMTO(Time Memory Trade Off)-based rainbow table method, proposed by Oechslin, is a useful one-way function re- versing method in cryptography. However, the world widely used original rainbow table method, which uses a single charset, could not be applied efficiently when dealing with a long plain due to the lack of computing resource and the significant increase of plain space. In considering the character of human passwords constitution, a new plain generation method based on segmented charset is introduced, which splices the plains from different charsets and forms a new plain. This method could effectively reduce the plain space and increase the max plain length the rainbow table is able to cover. The experiment recovering 1000 hashes corresponding to plains taken from the revealed CSDN password library indicates that the rainbow-table plain generation method based on segmented charset could raise the success rate of hash recovering by 39.1% when used in combination of the original rainbow table method.
作者 张琛岭
出处 《信息安全与通信保密》 2015年第1期99-102,共4页 Information Security and Communications Privacy
基金 上海市科委计划项目(No.13JG0500400)
关键词 单向函数 时间空间折中 彩虹表 真实口令 分段式字符集 哈希恢复成功率 one-way function, time-memory tradeoff, rainbow table, human password, segmented charset, success rate of hash recovenng
  • 相关文献

参考文献10

  • 1Hellman M E. A cryptanalytic time-memory trade-off [J]. In- formation Theory : IEEE Transactions on, 1980, 26 ( 4 ) : 401 - 406.
  • 2Robling Denning D E. Cryptography and data security [ M]. Addison-Wesley Longman Publishing Co. Inc.. USA:Addison -Wesley, 1982:100.
  • 3Oechslin P. Making a faster cryptanalytic time-memory trade- off[ M ]. Advances in Cryptology- CRYPTO. Berlin: Springer Berlin Heidelberg, 2003: 617-630.
  • 4Borst J, Preneel B, Vandewalle J. On the time-memory tradeoff between exhaustive key search and table prccomputa- tion[ C ]//Symposium on Information Theory in the Benelux. Veldhoven (NL): TECHNISCHE UNIVERSITEIT DELFT, 1998: 111-118.
  • 5Avoine G, Junod P, Oechslin P. Time-memory trade-offs: False alarm detection using checkpoints[ M] .Progress in Cryp- tology-INDOCRYPT. 2005. Berlin :Springer Berlin Heidel- berg, 2005: 183-196.
  • 6Ying H M, Thing V LL. A novel rainbow table sorting method [ C]//The Second International Conference on Technical and Legal Aspects of the e-Society. Gosier, Guadeloupe, France: CYBERLAWS,2011 : 35-40.
  • 7Thing V LL, Ying H M. Enhanced Dictionary Based Rainbow Table[ M ]//Information Security and Privacy Research. Ber- lin : Springer Berlin Heidelberg, 2012 : 513-524.
  • 8Kim B I, Hong J. Analysis of the non-perfect table fuzzy rainbow tradeoff[ C ]//Information Security and Privacy. Ber- lin :Springer Berlin Heidelberg, 2013 : 347-362.
  • 9Lee G W, Hong J. A Comparison of Perfect Table Cryptana- lytic TradeoffAlgorithms [ J ]. IACR Cryptology ePrint Ar- chive, 2012: 540-540.
  • 10Kim JW,Seo J, Hong J, Park K, Kim SR. High-speed par- allel implementations of the rainbow method in a heterogene- ous system[ Jl- INDOCRYPT,2012:303 - 316.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部