Results 221 to 230 of about 1,748,823 (282)

Probabilistic Algebraic Attacks

open access: yes, 2005
This paper investigates a probabilistic algebraic attack on LFSR-based stream ciphers. We consider two scenarios (S3a and S3b) proposed by Meier et al. at Eurocrypt 2004. In order to derive the probability in this new algebraic attack, we quantify the distance between a Boolean function and a function with annihilator of a certain degree.
An Braeken, Bart Preneel
openaire   +3 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
Qichun Wang, T. Johansson, Haibin Kan
exaly   +3 more sources

Algebraic Attacks on Round-Reduced Keccak

IACR Cryptology ePrint Archive, 2021
Since Keccak was selected as the SHA-3 standard, both its hash mode and keyed mode have attracted lots of third-party cryptanalysis. Especially in recent years, there is progress in analyzing the collision resistance and preimage resistance of round-reduced Keccak.
Fukang Liu   +3 more
openaire   +2 more sources

Algebraic Attacks on the Courtois Toy Cipher

Cryptologia, 2008
This article presents and discusses some of the most important algebraic attack algorithms (F4, DR, XL) and employs them against Courtois' toy cipher (CTC). Also, CTC is attacked using more specialized algorithms and the experimental results of these attacks are presented.
exaly   +2 more sources

Home - About - Disclaimer - Privacy