Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition

DOI10.1080/00207160.2014.910304zbMath1375.94145OpenAlexW1997019979MaRDI QIDQ5259050

Yu Lou, Zhangqing Wu, Huiting Han, Chun-Ming Tang, Mao-Zhi Xu

Publication date: 24 June 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.910304

zbMATH Keywords

balancednesspolar decompositionalgebraic immunityalgebraic degreevectorial Boolean functionhyper-bent function

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items

The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields

Cites Work

• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• Maximal values of generalized algebraic immunity
• Hyper-bent functions and cyclic codes
• Algebraic Attacks on the Courtois Toy Cipher
• VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES
• Algebraic and Slide Attacks on KeeLoq
• Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
• Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
• An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity
• Two Algebraic Attacks Against the F-FCSRs Using the IV Mode