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

Title:
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
Authors:
Claude Carlet, Palash Sarkar
Source:
Discrete Applied Mathematics. 373:256-270
Publication Status:
Preprint
Publisher Information:
Elsevier BV, 2025.
Publication Year:
2025
Subject Terms:
FOS: Computer and information sciences, Computer Science - Cryptography and Security, Cryptography and Security (cs.CR)
Document Type:
Fachzeitschrift Article
Language:
English
ISSN:
0166-218X
DOI:
10.1016/j.dam.2025.05.004
DOI:
10.48550/arxiv.2408.11583
Access URL:
http://arxiv.org/abs/2408.11583
Rights:
Elsevier TDM
CC BY NC SA
Accession Number:
edsair.doi.dedup.....b918ca71e29ea2cf10eabfc9540b59f2
Database:
OpenAIRE

Weitere Informationen

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\leq 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.
A major revision