期刊文献+

Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields 被引量:1

Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields
原文传递
导出
摘要 Boolean functions with optimal algebraic immunity(OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially ?nite ?elds, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of?nite ?elds turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng(2012), Tang, et al.(2017), and Lou, et al.(2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of ?nite ?elds. In this survey article, the authors review our work in this ?eld in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures. Boolean functions with optimal algebraic immunity(OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially ?nite ?elds, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of?nite ?elds turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng(2012), Tang, et al.(2017), and Lou, et al.(2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of ?nite ?elds. In this survey article, the authors review our work in this ?eld in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2019年第1期356-374,共19页 系统科学与复杂性学报(英文版)
基金 supported by the National Key Research and Development Program of China under Grant No.2016YFB0800401
关键词 Additive DECOMPOSITION algebraic immunity BOOLEAN function MULTIPLICATIVE DECOMPOSITION Tu-Deng CONJECTURE Additive decomposition algebraic immunity Boolean function multiplicative decomposition Tu-Deng conjecture
  • 相关文献

参考文献1

二级参考文献23

  • 1Carlet C, Boolean functions for cryptography and error correcting codes, in The Momography Boolean Methods and Models in Mathematics, Computer Science, and Engineering (ed. by Crama Y and Hammer P), Cambridge University Press, 2010, 257-397.
  • 2Courtois N and Meier W, Algebraic attacks on stream ciphers with linear feedback, Eurocrypt 2003, Lecture Notes in Computer Science, 2003, 2656: 345-359.
  • 3Meier W, Pasalic E, and Carlet C, Algebraic attacks and decomposition of Boolean functions, Eurocrypt 2004, Lecture Notes in Computer Science, 2004, 3027: 474-49l.
  • 4Armkneckt F, Improving fast algebraic attacks, FSE 2004, Lecture Notes in Computer Science, 2004, 3017: 65-82.
  • 5Courtois N T, Fast algebraic attacks on stream ciphers with linear feedback, Crypto 2003, Lecture Notes in Computer Science, 2003, 2729: 176-194.
  • 6CarIet C, A method of construction of balanced functions with optimum algebraic immunity, Cryptology ePrint Archive, 2006, Report 2006/149.
  • 7CarIet C, Dalai D K, Gupta K C, and Maitra S, Algebraic immunity for cryptographically signif?icant Boolean functions: Analysis and construction, IEEE Transaction on Information Theory, 2006, 52(7): 3105-312l.
  • 8CarIet C, Zeng X, Li C, and Hu L, Further properties of several classes of Boolean functions with optimum algebraic immunity, Designs, Codes, Cryptography, 2009, 52(3): 303-338.
  • 9Dalai D K, Maitra S, and Sarkar S, Basic theory in construction of Boolean functions with maximum possible annihilator immunity, Designs, Codes, Cryptography, 2006, 40(1): 41-58.
  • 10Li Nand Qi W, Construction and analysis of Boolean functions of 2t + 1 variables with maximum algebraic immunity, Asiacrypt 2006, Lecture Notes in Computer Science, 2006, 4284: 84-98.

同被引文献15

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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