A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions [PDF]
IEEE Access, 2019 Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the computer.
Yindong Chen +2 more
exaly +12 more sources
On the fast algebraic immunity of threshold functions [PDF]
Cryptography and Communications, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierrick Meaux
exaly +8 more sources
Fast Algebraic Immunity of Boolean Functions and LCD Codes [PDF]
IEEE Transactions on Information Theory, 2021 Nowadays, the resistance against algebraic attacks and fast algebraic attacks are considered as an important cryptographic property for Boolean functions used in stream ciphers. Both attacks are very powerful analysis concepts and can be applied to symmetric cryptographic algorithms used in stream ciphers.
Chunming Tang, Sihem Mesnager
exaly +10 more sources
A Bound of Fast Algebraic Immunity of Constructions With BPR Using a Four-Disjoint-Part Support [PDF]
IEEE Access, 2020 Boolean functions are used for stream cipher ought to be a high fast algebraic immunity (FAI) to effectively against fast algebraic attacks. In the previous research methods, there is no suitable method to gain the FAI of Boolean functions using mathematical proof. However, Tang’s research results in 2017 broke the trend.
Kai Xu
exaly +5 more sources
Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function [PDF]
IEEE Access, 2019 Boolean functions should possess high fast algebraic immunity (FAI) when it is used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the FAI of Boolean functions was usually calculated by computer. But, as everyone knows, it is very difficult to calculate the FAI of a given Boolean function with high ...
Yindong Chen, Weihong Cai
exaly +5 more sources
Fast algebraic immunity of Boolean functions [PDF]
Advances in Mathematics of Communications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sihem Mesnager, Gérard Cohen
exaly +10 more sources
Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks [PDF]
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly +5 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 ...
Deng Tang
exaly +4 more sources
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
Claude Carlet +2 more
exaly +3 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.
Meicheng Liu
exaly +5 more sources