Paper 2024/1305 Original: eprint.iacr.org/2024/1305 ↗
Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks
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\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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2025-01-12: last updated
- 2024-08-21: published
- Short URL
- https://ia.cr/2024/1305
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2024/1305,
author = {Claude Carlet and Palash Sarkar},
title = {Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1305},
year = {2024},
url = {https://eprint.iacr.org/2024/1305}
}