Results 1 to 10 of about 2,850 (241)
Algebraic Attacks on Summation Generators [PDF]
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n LFSRs, an algebraic equation relating the key stream bits and LFSR output bits can be made to be of degree less than or equal to \(^{\lceil\log_2 n \rceil}\) using ⌈log2 n ⌉ + 1 consecutive key stream bits. This is much lower
Jin Hong
exaly +5 more sources
Algebraic Attacks and Decomposition of Boolean Functions [PDF]
Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found.
Enes Pašalić +2 more
exaly +4 more sources
Algebraic Collision Attacks on Keccak
In this paper, we analyze the collision resistance of the two smallest versions of Keccak which have a width of 200 and 400 bits respectively. We show that algebraic and linearization techniques can serve collision cryptanalysis by using some interesting
Rachelle Heim Boissier +2 more
doaj +4 more sources
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks [PDF]
White-box cryptography attempts to protect cryptographic secrets in pure software implementations. Due to their high utility, white-box cryptosystems (WBC) are deployed by the industry even though the security of these constructions is not well defined ...
Okan Seker +2 more
doaj +3 more sources
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 ...
Philippe Gaborit +2 more
exaly +4 more sources
Algebraic Attacks on RFID Protocols [PDF]
This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concerning authentication, untraceability, and secrecy are discussed. We demonstrate the types of attacks by exhibiting previously unpublished vulnerabilities in several protocols and ...
Sasa Radomirovic +2 more
exaly +5 more sources
Improving Fast Algebraic Attacks [PDF]
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 +3 more sources
Improved Attacks on LowMC with Algebraic Techniques
The LowMC family of SPN block cipher proposed by Albrecht et al. was designed specifically for MPC-/FHE-/ZKP-friendly use cases. It is especially used as the underlying block cipher of PICNIC, one of the alternate third-round candidate digital signature
Yimeng Sun, Jiamin Cui, Meiqin Wang
doaj +3 more sources
Algebraic adversarial attacks on explainability models
Classical adversarial attacks are phrased as a constrained optimisation problem. Despite the efficacy of a constrained optimisation approach to adversarial attacks, one cannot trace how an adversarial point was generated.
Lachlan Simpson +5 more
doaj +3 more sources
Securing consensus in fractional-order multi-agent systems: Algebraic approaches against Byzantine attacks [PDF]
This paper investigates the behavior of fractional-order nonlinear multi-agent systems subjected to Byzantine assaults, specifically focusing on the manipulations of both sensors and actuators.
Yubin Zhong +6 more
doaj +2 more sources

