scispace - formally typeset
Journal ArticleDOI

Upper Bounds on the Imbalance of Discrete Functions Implemented by Sequences of Finite Automata

Reads0
Chats0
TLDR
A matrix representation and upper bounds on the imbalance of an arbitrary discrete function implemented by a sequence of finite automata are obtained and can be used to solve problems of proving the security of stream or block ciphers against a number of statistical attacks.
Abstract
A matrix representation and upper bounds on the imbalance of an arbitrary discrete function implemented by a sequence of finite automata are obtained. The obtained results generalize a number of previously known statements about matrix (linear) representations of the imbalance of functions of special form and can be used to solve problems of proving the security of stream or block ciphers against a number of statistical attacks.

read more

Citations
More filters
Journal Article

On differential properties of Pseudo-Hadamard transform and related mappings: (Extended abstract)

TL;DR: In this paper, a scalable linear-algebraic approach is proposed to derive differential probabilities of some related mappings like the subtraction and the pseudo-hadamard transform, and applied to analyze partial round mapping of Twofish.
Journal ArticleDOI

A Method of Evaluating the Security of Snow 2.0-Like Ciphers Against Correlation Attacks Over the Finite Extensions of Two Element Field

TL;DR: Application of the proposed method to SNOW 2.0 and Strumok ciphers shows that any of the considered correlation attacks on them over the field of order 256 has an average time complexity and requires no less than 2 142.77 and 2 249.
References
More filters
Book ChapterDOI

A New Version of the Stream Cipher SNOW

TL;DR: This paper proposes a new version of SNOW, called SNOW 2.0, which does not only appear to be more secure, but its implementation is also a bit faster in software.
Journal Article

Efficient algorithms for computing differential properties of addition

TL;DR: In this paper, the authors systematically studied the differential properties of addition modulo 2 and presented log-time algorithms for most of the properties, including the differential probability of addition, for finding good differentials.
Book ChapterDOI

Improved linear distinguishers for SNOW 2.0

TL;DR: A new linear distinguisher with bias 2 -86 9 is found that is significantly stronger than the previously found ones by Watanabe et al. (2003) and makes it possible to distinguish the output keystream of SNOW 2.0 from a truly random sequence.
Book ChapterDOI

On the Additive Differential Probability of Exclusive-Or

TL;DR: In this article, the differential probability adp ⊕ of exclusive-or when differences are expressed using addition modulo 2 N has been studied, where addition is used to add in the round keys.
Book ChapterDOI

Cryptographic Significance of the Carry for Ciphers Based on Integer Addition

TL;DR: It is shown that asymptotically the carry for integer addition with an arbitrary number n of inputs is balanced for even n and biased for odd n, and for n = 3 the carry is strongly biased, whereas for increasing n it is shown the bias tends to 0.
Related Papers (5)