Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks

Authors

• Claude Carlet, Université Paris 8 Vincennes-St Denis
• Palash Sarkar, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Discrete Applied Mathematics

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.

First Page

256

Last Page

270

DOI

10.1016/j.dam.2025.05.004

Publication Date

10-15-2025

Recommended Citation

Carlet, Claude and Sarkar, Palash, "Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks" (2025). Journal Articles. 5655.
https://digitalcommons.isical.ac.in/journal-articles/5655