In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain-128, reduced variants of the block ciphers Serpent and
2 September 2024 in Cryptography and Communications
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either direction. In particular we establish how two variants of a generalised Lempel homomorphism can be used to recursively construct such sequences, generalising previous work on the binary case. We also derive an upper bound on the period of an orientable sequence.
We construct feedback functions of Nonlinear Feedback Shift Registers from those of Linear Feedback Shift Registers using the cross-join pairs method and the Zech logarithms in finite fields. We present a hypothetical algorithm to generate all de Bruijn sequences of a given order.