Testing a Cellular Automata Construction Method to Obtain 9-variable Cryptographic Boolean Functions

被引:0
作者
Prevost, Thomas [1 ]
Martin, Bruno [1 ]
机构
[1] Univ Cote Azur, CNRS, I3S, Nice, France
关键词
Boolean functions; cellular automata; cryptography; affine equivalence classes;
D O I
10.32908/jca.v18.100924
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a method for constructing 9-variable cryptographic Boolean functions from the iterates of 5-variable cellular automata rules. We then analyze, for important cryptographic properties of 5variable cellular automata rules, how they are preserved after extension to 9-variable Boolean functions. For each cryptographic property, we analyze the proportion of 5-variable cellular automata rules that preserve it for each of the 48 affine equivalence classes.
引用
收藏
页码:187 / 205
页数:19
相关论文
共 24 条
  • [1] Biryukov Alex, De Canniere Christophe, Linear cryptanalysis for block ciphers, Encyclopedia of cryptography and security, (2011)
  • [2] Braeken An, Borissov Yuri, Nikova Svetla, Preneel Bart, Classification of Boolean functions of 6 variables or less with respect to cryptographic properties, Cryptology ePrint Archive, (2004)
  • [3] Carlet Claude, Correlation Immune and Resilient Boolean Functions, (2011)
  • [4] Carlet Claude, Crama Yves, Hammer Peter L, Boolean functions for cryptography and error-correcting codes, (2010)
  • [5] Daemen Joan, Govaerts Rene, Vandewalle Joos, A framework for the design of one-way hash functions including cryptanalysis of Damgård’s one-way function based on a cellular automaton, Advances in Cryptology—ASIACRYPT’91: International Conference on the Theory and Application of Cryptology Fujiyosida, (1993)
  • [6] Formenti Enrico, Imai Katsunobu, Martin Bruno, Yunes Jean-Baptiste, Advances on random sequence generation by uniform cellular automata, Computing with new resources: essays dedicated to jozef gruska on the occasion of his 80th birthday, (2014)
  • [7] Fuller Joanne Elizabeth, Analysis of affine equivalent Boolean functions for cryptography, (2003)
  • [8] Gouget Aline, On the propagation criterion of Boolean functions, Coding, Cryptography and Combinatorics, (2004)
  • [9] Hanin Charifa, Echandouri Bouchra, Omary Fouzia, Bernoussi Souad El, Lcahash: A novel lightweight hash function based on cellular automata for RFID, Ubiquitous Networking: Third International Symposium, UNet 2017, (2017)
  • [10] Jamil Norziana, Mahmood Ramlan, Muhammad R, A new cryptographic hash function based on cellular automata rules 30, 134 and omega-flip network, ICICN 2012, (2012)