Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]
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
semanticscholar +6 more sources
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity [PDF]
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
semanticscholar +4 more sources
The Exact Fast Algebraic Immunity of Two Subclasses of the Majority Function
Rong Luo, Deng Tang, Xiaoni Du
exaly +3 more sources
Hybrid tabu search algorithm for excellent Boolean function [PDF]
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 +5 more sources
Spatial-Wavelength Multiplexing Error-Controlled Photonic Analog Computing System. [PDF]
A novel photonic integrated circuit prototype implementing the concept of general‐purpose analog computing and demonstrate its capability in radio frequency applications. The chip features a multichannel architecture and performs fully optical analog computation with frequency‐domain parallel processing. An FPGA‐based error‐correction algorithm aims to
Zhu T +15 more
europepmc +2 more sources
Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity
Fang-Wei Fu
exaly +2 more sources
On algebraic immunity and annihilators [PDF]
Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and AI(f) are inefficient. This work consists of two parts.
Zheng, Yuliang +5 more
core +1 more source
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
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
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
A note on fast algebraic attacks and higher order nonlinearities [PDF]
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 given), and find that a Boolean function should have high r-order nonlinearity to
Wang, Qichun +3 more
core +3 more sources

