Results 111 to 120 of about 475 (134)

Mathematical modeling of cholera dynamics with intrinsic growth considering constant interventions. [PDF]

Sci Rep
Brhane KW, Ahmad AG, Hina H, Emadifar H.
europepmc   +1 more source

ChebIoD: a Chebyshev polynomial-based lightweight authentication scheme for internet of drones environments. [PDF]

Sci Rep
Al-Mekhlafi ZG, Altmemi JMH, Al-Shareeda MA, Al-Hchaimi AAJ, Homod RZ, Mohammed BA, Alshammari G, Al-Dhlan KA, Alrashdi R, Alkhabra YA.   +9 more
europepmc   +1 more source

Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity

IEEE Transactions on Information Theory, 2017
In 2013, Tang, Carlet, and Tang [IEEE TIT 59(1): 653–664, 2013] presented two classes of Boolean functions. The functions in the first class are unbalanced and the functions in the second one are balanced. Both of those two classes of functions have high nonlinearity, high algebraic degree, optimal algebraic immunity, and high fast algebraic immunity ...
Deng Tang, Claude Carlet, Xiaohu Tang
exaly   +5 more sources

Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yindong Chen
exaly   +4 more sources

Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks

Lecture Notes in Computer Science, 2006
We show in this paper how to apply well known methods from sparse linear algebra to the problem of computing the immunity of a Boolean function against algebraic or fast algebraic attacks. For an n-variable Boolean function, this approach gives an algorithm that works for both attacks in O(n2nD) complexity and O(n2n) memory. Here and d corresponds to
Frédéric Didier
exaly   +4 more sources

On the Fast Algebraic Immunity of Majority Functions [PDF]

, 2019
In different contexts such as filtered LFSR, Goldreich’s PRG, and FLIP stream ciphers, the security of a cryptographic primitive mostly depends on the algebraic properties of one Boolean function. Since the Seventies, more and more efficient attacks have been exhibited in this context, related to more and more general algebraic properties, such as the ...
Pierrick Méaux
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

Information Sciences, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meicheng Liu, Dongdai Lin
exaly   +3 more sources

On the security of the Feng–Liao–Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks

Designs, Codes, and Cryptography, 2010
Let \(\{b_1,\dots,b_n\}\) be a basis of \({\mathbb F}_{2^n}\). By identifying every element \(x = \sum_{i=1}^n x_ib_i\) of \({\mathbb F}_{2^n}\) with the \(n\)-tuple of its coordinates \((x_1,\dots,x_n)\), we define a natural correspondence between Boolean functions and polynomials functions from \( {\mathbb F}_{2^n}\) to \( {\mathbb F}_2\).
Panagiotis Rizomiliotis, Rizomiliotis Panagiotis   +1 more
exaly   +3 more sources

Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks

, 2014
Given a Boolean function with n variables, a revised algorithm for computing the algebraic immunity d against conventional algebraic attacks in O(D 2±e ) complexity is described for \(D=\sum _{i = 0}^d {n \choose i}\) and a small e, which corrects and clarifies the most efficient algorithm so far at Eurocrypt 2006.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +2 more sources