Results 11 to 20 of about 475 (134)

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, Carlet, Claude, Gaborit, Philippe, Künzli, Simon, Meier, Willi, Ruatta, Olivier   +5 more
openaire   +4 more sources

Hybrid tabu search algorithm for excellent Boolean function [PDF]

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, Haojie XU, Meng CUI, Qiong XIE   +3 more
doaj   +4 more sources

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   +2 more sources

Constructing Odd-Variable Rotation Symmetric Boolean Functions With Optimal AI and Higher Nonlinearity

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, Lumin Liao, Fei Guo, Weihong Cai   +3 more
doaj   +1 more source

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, Limin Lin, Lumin Liao, Jie Ruan, Fei Guo, Weihong Cai   +5 more
doaj   +1 more source

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, Liu Zhang, Zhangquan Gong, Weihong Cai   +3 more
doaj   +1 more source

Spatial-Wavelength Multiplexing Error-Controlled Photonic Analog Computing System. [PDF]

Adv Sci (Weinh)
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, Zhu B, Zhang S, Li K, Wu X, Pi Y, Yan J, Chen D, Guo B, Xiao X, Wang L, Xu X, Xue X, Huang S, Cao Z, Yu S.   +15 more
europepmc   +2 more sources

A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions [PDF]

, 2022
peer reviewedIn this paper, we make a comprehensive study of two classes of Boolean functions whose interest originally comes from hybrid symmetric-FHE encryption (with stream ciphers like FiLIP), but which also present much interest for general stream ...
MEAUX, Pierrick, Carlet, Claude
core   +1 more source

On algebraic immunity and annihilators

, 2006
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, Josef Pieprzyk, Yuliang Zheng, Zhang, Xian-Mo, Pieprzyk, Josef, Xian-Mo Zhang   +5 more
core   +1 more source

A note on fast algebraic attacks and higher order nonlinearities

, 2011
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, Thomas Johansson, Qichun Wang, Johansson, Thomas   +3 more
core   +2 more sources