Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity (Q2214052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7282517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity |
scientific article; zbMATH DE number 7282517 |
Statements
Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity (English)
0 references
4 December 2020
0 references
A high nonlinearity and a high resiliency order are necessary requirements for a Boolean function in cryptographic applications. By Parseval's identity, there is a natural trade-off between nonlinearity and resiliency. In this article, the authors improve the High-Meets-Low technique in [\textit{W. Zhang}, IEEE Trans. Inf. Theory 65, No. 9, 5856--5864 (2019; Zbl 1432.94148)], and present two constructions of Boolean functions in odd number \(n\) of variables (\(n = 2k+15\), \(n = 2k+9\)) with simultaneously high nonlinearity and high resiliency order. The obtained functions with a higher resiliency order attain the currently best known nonlinearity.
0 references
Boolean function
0 references
nonlinearity
0 references
resiliency
0 references
stream cipher
0 references
symmetric cryptography
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9088788032531738
0 references
0.8975603580474854
0 references
0.8778775334358215
0 references
0.8577882647514343
0 references
0.8521894216537476
0 references
