Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks

2024/08/21 by Claude Carlet, Palash Sarkar, Carlet, Claude +1
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.2408.11583

openalex publication_date 2024/08/21 · openalex created_date 2024/12/16 · openalex updated_date 2026/07/28

Abstract

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for n≤ 20, we show that there are functions in the family achieving a combination of nonlinearity and (fast) algebraic immunity which is superior to what is achieved by any other efficiently implementable function. The main novelty of our approach is to apply a judicious combination of simple integer and binary field arithmetic to Boolean function construction.

Related

• Constructions of Efficiently Implementable Boolean Functions with Provable Nonlinearity/Resiliency/Algebraic Immunity Trade-Offs
• Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
• The complexity of Boolean functions from cryptographic viewpoint
• Constructing Boolean Functions With Potential Optimal Algebraic Immunity Based on Additive Decompositions of Finite Fields
• Lower Bounds on the Algebraic Immunity of Boolean Functions