Parallel Steepest Ascent Hill-Climbing for High Nonlinear Boolean and Vectorial Boolean Functions (S-Boxes)
暂无分享,去创建一个
[1] Jia Feng,et al. Improved hill-climbing methods in the design of bijective S-boxes , 2010, 2010 Sixth International Conference on Natural Computation.
[2] William Millan,et al. An effective genetic algorithm for finding highly nonlinear Boolean Functions , 1997, ICICS.
[3] Svetla Nikova,et al. Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties , 2016, Cryptography and Communications.
[4] Athmane Seghier,et al. Progressive Two-bits Tweak for Linear Redundancy reduction from Finite Field S-Boxes , 2018, ICCNS.
[5] P. Tesar. A New Method for Generating High Non-linearity S-Boxes , 2010 .
[6] Vincent Rijmen,et al. The Design of Rijndael: AES - The Advanced Encryption Standard , 2002 .
[7] Susan Stepney,et al. Evolving Boolean Functions Satisfying Multiple Criteria , 2002, INDOCRYPT.
[8] Yang Li,et al. A novel method to design S-box based on chaotic map and genetic algorithm , 2012 .
[9] William Millan,et al. How to Improve the Nonlinearity of Bijective S-Boxes , 1998, ACISP.
[10] Yong Wang,et al. A Method for Constructing Bijective S-Box with High Nonlinearity Based on Chaos and Optimization , 2015, Int. J. Bifurc. Chaos.
[11] Tariq Shah,et al. An efficient approach for the construction of LFT S-boxes using chaotic logistic map , 2012, Nonlinear Dynamics.
[12] Subhamoy Maitra,et al. Further constructions of resilient Boolean functions with very high nonlinearity , 2002, IEEE Trans. Inf. Theory.
[13] Musheer Ahmad,et al. A Novel Ant Colony Optimization Based Scheme for Substitution Box Design , 2015 .
[14] Stjepan Picek,et al. A New Cost Function for Evolution of S-Boxes , 2016, Evolutionary Computation.
[15] William Millan,et al. On Linear Redundancy in the AES S-Box , 2002, IACR Cryptol. ePrint Arch..
[16] Vincent Rijmen,et al. The Design of Rijndael , 2002, Information Security and Cryptography.
[17] Susan Stepney,et al. The design of S-boxes by simulated annealing , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[18] William Millan,et al. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 29 (2004), Pages 231–247 Simpler methods for generating better Boolean functions with good cryptographic properties , 2022 .
[19] Herman ISA,et al. Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance , 2016, New Generation Computing.
[20] Roberto Santana,et al. Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).
[21] William Millan,et al. Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes , 1999, ICICS.
[22] Xu Xiangyang,et al. The block cipher for construction of S-boxes based on particle swarm optimization , 2010, 2010 International Conference on Networking and Digital Society.
[23] William Millan,et al. Linear Redundancy in S-Boxes , 2003, FSE.
[24] Wang Yong,et al. An Improved Method to Obtaining S-Box Based on Chaos and Genetic Algorithm , 2012 .
[25] Alexandr Kuznetsov,et al. The Design of Boolean Functions by Modified Hill Climbing Method , 2009, 2009 Sixth International Conference on Information Technology: New Generations.
[26] John A. Clark,et al. Two-Stage Optimisation in the Design of Boolean Functions , 2000, ACISP.