Results 101 to 110 of about 487 (136)

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

open access: yesSci Rep
Al-Mekhlafi ZG   +9 more
europepmc   +1 more source

A novel image encryption framework using Wireworld cellular automaton and hybrid chaotic maps for enhanced security. [PDF]

open access: yesPLoS One
Alabdullah B   +6 more
europepmc   +1 more source

Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks

IEEE Transactions on Information Theory, 2013
Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean functions of 2k variables where k ≥ 2. The first class contains unbalanced functions having high algebraic degree and nonlinearity. The functions in the second one are balanced and have maximal algebraic degree and high nonlinearity (as shown by a lower bound that ...
Claude Carlet, Xiaohu Tang, Deng Tang
exaly   +3 more sources

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.
Dongdai Lin, Meicheng Liu
exaly   +3 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
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   +1 more
exaly   +3 more sources

Cryptanalysis of Keystream Generator by Decimated Sample Based Algebraic and Fast Correlation Attacks

Lecture Notes in Computer Science, 2005
This paper proposes a novel approach for cryptanalysis of keystream generators consisting of the composition of a linear finite state machine (LFSM) and nonlinear mapping. The proposed approach includes a dedicated decimation of the sample for cryptanalysis based on the following: Suppose certain B bits of the LFSM initial state as known and identify ...
Marc P C Fossorier   +2 more
exaly   +2 more sources

Home - About - Disclaimer - Privacy