Perfect algebraic immune functions

M Liu, Y Zhang, D Lin - International Conference on the Theory and …, 2012 - Springer
A perfect algebraic immune function is a Boolean function with perfect immunity against
algebraic and fast algebraic attacks. The main results are that for a perfect algebraic immune …

Fast algebraic attacks and decomposition of symmetric Boolean functions

M Liu, D Lin, D Pei - IEEE Transactions on Information Theory, 2011 - ieeexplore.ieee.org
In this correspondence, first we give a decomposition of symmetric Boolean functions, then
we show that almost all symmetric Boolean functions, including these functions with good …

A note on fast algebraic attacks and higher order nonlinearities

Q Wang, T Johansson - … , Inscrypt 2010, Shanghai, China, October 20-24 …, 2011 - Springer
In this note, we deduce a bound between fast algebraic immunity and higher order
nonlinearity (it is the first time that a bound between these two cryptographic criteria is …

[HTML][HTML] Boolean functions optimizing most of the cryptographic criteria

Z Tu, Y Deng - Discrete Applied Mathematics, 2012 - Elsevier
In this paper, we construct a class of 2k-variable Boolean functions which have optimal
algebraic degree, very high nonlinearity, optimal algebraic immunity, and are 1-resilient …

Fast algebraic immunity of Boolean functions and LCD codes

S Mesnager, C Tang - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
Nowadays, the resistance against algebraic attacks and fast algebraic attacks are
considered as an important cryptographic property for Boolean functions used in stream …

[HTML][HTML] Cryptographic properties of the hidden weighted bit function

Q Wang, C Carlet, P Stănică, CH Tan - Discrete Applied Mathematics, 2014 - Elsevier
The hidden weighted bit function (HWBF), introduced by R. Bryant in IEEE Trans. Comp. 40
and revisited by D. Knuth in Vol. 4 of The Art of Computer Programming, is a function that …

On the algebraic immunity—resiliency trade-off, implications for Goldreich's pseudorandom generator

A Dupin, P Méaux, M Rossi - Designs, Codes and Cryptography, 2023 - Springer
Goldreich's pseudorandom generator is a well-known building block for many theoretical
cryptographic constructions from multi-party computation to indistinguishability obfuscation …

Boolean functions with maximum algebraic immunity: further extensions of the Carlet–Feng construction

K Limniotis, N Kolokotronis - Designs, Codes and Cryptography, 2018 - Springer
The algebraic immunity of Boolean functions is studied in this paper. More precisely, having
the prominent Carlet–Feng construction as a starting point, we propose a new method to …

Secondary constructions of Boolean functions with maximum algebraic immunity

K Limniotis, N Kolokotronis, N Kalouptsidis - Cryptography and …, 2013 - Springer
The algebraic immunity of cryptographic Boolean functions with odd number of variables is
studied in this paper. Proper modifications of functions with maximum algebraic immunity …

Properties of a family of cryptographic Boolean functions

Q Wang, CH Tan - Sequences and Their Applications-SETA 2014: 8th …, 2014 - Springer
Abstract In 2008, Carlet and Feng studied a class of functions with good cryptographic
properties. Based on that function,[18] proposed a family of cryptographically significant …