期刊文献+

一类新的基于元胞自动机的S盒的密码学性质研究 被引量:5

Research on cryptographic properties of a new S-box based on cellular automaton
下载PDF
导出
摘要 通过实验找到了一类新的基于元胞自动机的S盒,分析了该S盒的置换性质,证明了其仅在规模为5时是一个置换。通过构造差分矩阵的方法给出了该S盒的非平凡差分转移概率与差分矩阵的秩之间的关系,从而得到其取值范围。证明了对输入差分进行循环移位不改变其对应的非平凡差分转移概率,从而给出其在规模为5时取最大和最小非平凡差分转移概率的充要条件,彻底解决了此时该S盒的差分对应的结构和计数问题。 A new S-box based on cellular automata was found by experiments. The permutation properties of the S-box were analyzed, which proved that the S-box was a permutation only when the size of lattice was 5. Then the relation be- tween the nontrivial difference transition probability of the S-box and the rank of the difference matrix was proved by constructing the difference matrix. And it was proved that the cyclic shift of input differential would not change the cor-responding nontrivial differential transition probability, and obtained the sufficient and necessary conditions about the maximum and minimum nontrivial differential transition probabilities when the size of lattice was 5. Then the problem of the difference distribution of the S-box in this situation is completely solved.
作者 关杰 黄俊君 GUAN Jie;HUANG Junjun(Institute of Cryptography Engineering,Information Engineering University, Zhengzhou 450001,China)
出处 《通信学报》 EI CSCD 北大核心 2019年第5期192-200,共9页 Journal on Communications
基金 国家自然科学基金资助项目(No.61572516 No.61272041 No.61272488)~~
关键词 元胞自动机 S盒 置换性质 差分分析 cellular automaton S-box permutation property differential analysis
  • 相关文献

参考文献1

二级参考文献11

  • 1NIST. Announcing request for candidate algorithm nominations for a new cryptographic hash algorithm (SHA-3) family[J]. Federal Register Notices 72, 2007, 212: 62212-62220.
  • 2ANDREW R, RAY P, CHANG S J. Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition[R]. Infor marion Technology Laboratory National Institute of Standards and Technology, Gaithersburg, 2009.
  • 3MELTEM S T, RAY P, LAWRENCE E B, et al. Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competi tion. Computer Security Division[R]. Information Technology Labo-ratory National Institute of Standards-and Technology, Gaithersburg, 2011.
  • 4NIST. The SHA-3 Finalists candidates U S department of commerce national information service[EB/OL], http://csrc, nist.gov. /groups/ ST/hash/sha-3/Round3/submissions-round3. html.
  • 5GUIDO B, JOAN D, MICHAEL P, et al. Keccak sponge function family maiia document[EB/OL], http://csrc, nist.gov /groups/ ST /hash /sha-3/Roundl/submissions roundl. Html.
  • 6罗岚,叶娅兰,许春香等.在信念网模型下的SHA3前五名算法注记[EB/OL].htcp://www.scienceet.cn/upload/blog/-ile/2010/12/2010121592436256375.pdf.
  • 7GUIDO B, JOAN D, MICHAEL P, et al. A belt-and-mill hash func- tion[EB/OL], http://radiogatun.noekeon.org.
  • 8JOAN D, CLAPP C S K. Fast hashing and stream encryption with PANAMA[A]. Fast Software Encryption 1998 (S Vaudenay, ed)[C]. 1998.60-74.
  • 9JOAN D. Cipher and Hash Function Design Strategies Based on Lin- ear and Differential Cryptanalysis[D]. Belgium: Katholieke Univer- sities Leuven, 1995.
  • 10EPHRAIM A. Sharing Nonlinear Gates in the Presence of Glitches[D]. Enschede, Holland: University of Twente, 2010.

共引文献6

同被引文献6

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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