Results 1 to 10 of about 650 (169)

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions [PDF]

open access: yesIEEE Transactions on Information Theory, 2011
13 pages, submitted to IEEE Transactions on Information ...
Meicheng Liu, Dongdai Lin
exaly   +4 more sources

Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers [PDF]

open access: yesLecture Notes in Computer Science, 2004
Recently proposed algebraic attacks [2,6] and fast algebraic attacks [1,5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exponential in the degree of the equations. Fast algebraic attacks were introduced [5] as a way of reducing run-time complexity by reducing the degree of the system of equations ...
Philip Hawkes, Gregory G. Rose
exaly   +5 more sources

Some results on fast algebraic attacks and higher-order non-linearities

open access: yesIET Information Security, 2012
In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given).
Qichun Wang   +2 more
exaly   +3 more sources

Improving Fast Algebraic Attacks [PDF]

open access: yesLecture Notes in Computer Science, 2004
An algebraic attack is a method for cryptanalysis which is based on finding and solving a system of nonlinear equations. Recently, algebraic attacks where found helpful in cryptanalysing LFSR-based stream ciphers. The efficiency of these attacks greatly depends on the degree of the nonlinear equations.
Frederik Armknecht, Armknecht Frederik
exaly   +4 more sources

Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]

open access: yesLecture Notes in Computer Science, 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 ...
Frederik Armknecht   +2 more
exaly   +4 more sources

New Low-Memory Algebraic Attacks on LowMC in the Picnic Setting

open access: yesIACR Transactions on Symmetric Cryptology, 2022
The security of the post-quantum signature scheme Picnic is highly related to the difficulty of recovering the secret key of LowMC from a single plaintext-ciphertext pair.
Fukang Liu   +3 more
doaj   +5 more sources

More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks [PDF]

open access: yesIEEE Transactions on Information Theory, 2011
In this paper, three constructions of balanced Boolean functions with optimal algebraic immunity are proposed. It is checked that, at least for small numbers of input variables, these functions have good behavior against fast algebraic attacks as well. Other cryptographic properties such as algebraic degree and nonlinearity of the constructed functions
Xiangyong Zeng   +2 more
exaly   +2 more sources

Fast Algebraic Attacks on Stream Ciphers with Linear Feedback [PDF]

open access: yesLecture Notes in Computer Science, 2003
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attacks, that can be seen as solving a system of multivariate linear equations, true with some probability.
Nicolas T Courtois, Courtois Nicolas T
exaly   +2 more sources

On the immunity of rotation symmetric Boolean functions against fast algebraic attacks

open access: yesDiscrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meicheng Liu, Dongdai Lin
exaly   +4 more sources

Key-Dependent Feedback Configuration Matrix of Primitive σ–LFSR and Resistance to Some Known Plaintext Attacks

open access: yesIEEE Access, 2022
In this paper, we propose and evaluate a method for generating key-dependent feedback configurations (KDFC) for $\sigma $ -LFSRs. $\sigma $ -LFSRs with such configurations can be applied to any stream cipher that uses a word-based LFSR.
Subrata Nandi   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy