Results 1 to 10 of about 7,683 (138)
Fast Algebraic Immunity of
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.
Yindong Chen +3 more
doaj +3 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 ...
Kai Xu, Ying Zhang, Jing Wang
doaj +2 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.
Sihem Mesnager, Chunming Tang
openaire +3 more sources
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]
, 2006 In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in $\mathcal{O}(D^2)$ operations, for $D ...
Armknecht, Frederik +5 more
openaire +3 more sources
A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS [PDF]
International Journal of Foundations of Computer Science, 2014 Recently, Tang, Carlet and Tang presented a combinatorial conjecture about binary strings, allowing proving that all balanced functions in some infinite class they introduced have optimal algebraic immunity. Later, Cohen and Flori completely proved that the conjecture is true.
Tang, Deng, Carlet, Claude, Tang, Xiaohu
openaire +4 more sources
Hybrid tabu search algorithm for excellent Boolean function
Tongxin xuebao, 2022 Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm, a new heuristic generation ...
Weiqiong WANG +3 more
doaj +2 more sources
On the fast algebraic immunity of threshold functions
Cryptography and Communications, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions
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 ...
Yindong Chen +3 more
doaj +1 more source
IEEE Access, 2019 As a part of the field of cryptography, rotation symmetric Boolean functions have rich cryptographic significance. In this paper, based on the knowledge of integer compositions, we present a new construction of odd-variable rotation symmetric Boolean ...
Yindong Chen +3 more
doaj +1 more source
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 +3 more sources