期刊文献+

优良布尔函数的混合禁忌搜索算法 被引量:1

Hybrid tabu search algorithm for excellent Boolean function
下载PDF
导出
摘要 为保障对称密码算法的安全性,其构成算法中所使用的布尔函数必须具有优良的密码学性质。结合禁忌搜索算法和爬山算法的优点,提出了一种新的优良布尔函数启发式生成算法——混合禁忌搜索算法。应用该算法,可以快速得到大量具有高非线性度、低自相关性、一阶弹性、最优代数次数、最优代数免疫度、最优(次优)抵抗快速代数攻击能力等的布尔函数。仿真结果表明,所提算法搜索能力强,运行速度快,且搜索出的布尔函数的密码学性质优于已知的优化算法的结果,也弥补了采用构造法构造布尔函数的一些缺陷。 Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm,a new heuristic generation algorithm called hybrid tabu search algorithm for excellent Boolean function was proposed.A large number of Boolean function with high nonlinearity,low autocorrelation,one-resilient,optimal algebraic degree,optimal algebraic immunity,optimal(suboptimal)resistance to fast algebraic attacks could be obtained quickly by applying the proposed algorithm.Simulation results demonstrate that the cryptographic properties of the Boolean function obtained by the proposed algorithm with strong search ability and fast running speed are better than the results of known optimization algorithm.Moreover,the algorithm also provides good Boolean function that cannot be obtained by using construction method.
作者 王维琼 许豪杰 崔萌 谢琼 WANG Weiqiong;XU Haojie;CUI Meng;XIE Qiong(School of Sciences,Chang’an University,Xi’an 710064,China)
机构地区 长安大学理学院
出处 《通信学报》 EI CSCD 北大核心 2022年第5期133-143,共11页 Journal on Communications
基金 国家自然科学基金资助项目(No.11901049) 陕西省自然科学基础研究计划基金资助项目(No.2020JQ-343) 陕西省高校科协青年人才托举计划基金资助项目(No.20200505)。
关键词 布尔函数 禁忌搜索算法 弹性 非线性度 Boolean function tabu search algorithm resiliency nonlinearity
  • 相关文献

参考文献6

二级参考文献36

  • 1Rothaus O S. On'bent' functions[ J]. Journal of Combinatolial Theory, Series A, 1976,20(3) : 300 -305.
  • 2Golomb S W, Gong G. Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar [ M ]. Cam-bridge, U K:Cambridge University Press,2005.
  • 3Zhang W G, Xiao G Z. Constructions of almost optimal resilient Boolean functions on large even number of variables[ J]. IEEE. Transactiom on Information Theory, 2009, 55 ( 12 ) : 5822 -5831.
  • 4Dillon J F. Elementary Hadamard Difference Set [ D ]. Mary-land: University of Maryland, College Park, 1974.
  • 5Seberry J, Zhang X M, Zheng Y. Nonlinearly balanced Boolean functions and their propagation characteristics[ A]. Advances in Crypmlogy-CRYFID' 93, Lecture Notes in Computer Science [ C]. Berlin, Germany: Springer-Verlag, 1994.49 -60.
  • 6MILLAN W,CLARK A,DAWSON E.Smart hill climbing finds better boolean functions[A].Workshop on Selected Areas in Cryptology[C].1997.50-63.
  • 7MILLAN W,CLARK A,DAWSON E.Boolean function design using hill climbing methods[A].4^th Australasian Conference on Information Security and Privacy,LNCS[C].Springer Verlag,1999.1-11.
  • 8MILLAN W,CLARK A,DAWSON E.An effective genetic algorithm for finding highly nonlinear boolean functions[A].First International Conference on Information and Communications Security,LNCS[C].,Springer Verlag,1997.149-158.
  • 9MILLAN W,CLARK A,DAWSON E.Heuristic design of cryptographically strong balanced boolean functions[A].Advances in Cryptology EUROCRYPT'98,LNCS[C].Springer Verlag,1998.489-499.
  • 10CLARK A,JACOB L.Two-stage optimization in the design of boolean functions[A].5^th Australasian Conference on Information,Security and Privacy,ACISP 2000,LNCS[C].Springer Verlag,2000.242-254.

共引文献10

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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