More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks [PDF]
IEEE Transactions on Information Theory, 2011 In this paper, three constructions of balanced Boolean functions with optimal algebraic immunity are proposed. It is checked that, at least for small numbers of input variables, these functions have good behavior against fast algebraic attacks as well. Other cryptographic properties such as algebraic degree and nonlinearity of the constructed functions
Xiangyong Zeng +3 more
openaire +3 more sources
Fast algebraic immunity of Boolean functions
Advances in Mathematics of Communications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mesnager, Sihem, Cohen, Gérard
openaire +5 more sources
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Yin, Liu, Meicheng, Lin, Dongdai
openaire +4 more sources
A note on the fast algebraic immunity and its consequences on modified majority functions
Advances in Mathematics of Communications, 2020 Boolean functions used as nonlinear filters and/or combiners in LFSR-based stream ciphers should satisfy several desired cryptographic properties simultaneously, to withstand all known cryptographic attacks. In the past decade, the algebraic and fast algebraic immunities are the most infusive criteria on the design of cryptographic Boolean functions ...
openaire +4 more sources
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
IEEE Access, 2019 Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of
Yindong Chen +5 more
doaj +1 more source
Fast Deterministic Selection [PDF]
, 2016 The Median of Medians (also known as BFPRT) algorithm, although a landmark theoretical achievement, is seldom used in practice because it and its variants are slower than simple approaches based on sampling.
Alexandrescu, Andrei
core +2 more sources
Constructing Two Classes of Boolean Functions With Good Cryptographic Properties
IEEE Access, 2019 Wu et al. proposed a generalized Tu-Deng conjecture over $\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ , and constructed Boolean functions with good properties. However the proof of the generalized conjecture is still open.
Yindong Chen +3 more
doaj +1 more source
CED: Color Event Camera Dataset [PDF]
, 2019 Event cameras are novel, bio-inspired visual sensors, whose pixels output asynchronous and independent timestamped spikes at local intensity changes, called 'events'.
Barnes, Nick +5 more
core +2 more sources
The complexity of Boolean functions from cryptographic viewpoint [PDF]
, 2006 Cryptographic Boolean functions must be complex to satisfy Shannon\u27s principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit complexity.
Carlet, Claude
core +1 more source
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity [PDF]
, 2008 After the improvement by Courtois and Meier of the algebraic attacks on stream ciphers and the introduction of the related notion of algebraic immunity, several constructions of infinite classes of Boolean functions with optimum algebraic immunity have been proposed.
Claude Carlet, Keqin Feng
openaire +1 more source