Finding Non-liner Register on Binary M-Sequence Generating Binary Multiplication Sequence

In the current time there is an important problem that is for a received linear or nonlinear binary sequence {zn} how we can find the nonlinear feedback shift register and its linear equivalent which generate this sequence. The linear orthogonal sequences, special M-Sequences, play a big role in these methods for solving this problem. In the current research trying give illuminations about the methods which are very useful for solving this problem under short sequences, and study these methods for finding the nonlinear feedback shift register of a multiplication sequence and its linear equivalent feedback shift register of a received multiplication binary sequence{zn} where the multiplication on h degrees of a binary linear sequence {an}, or finding the equivalent linear feedback shift register of {zn}, where the sequence {zn}of the form M-sequence, and these methods are very effectively. We can extend these methods for the large sequences using programming and modern computers with large memory.

Improved Conditional Differential Analysis on NLFSR-Based Block Cipher KATAN32 with MILP

In this paper, a new method for constructing a Mixed Integer Linear Programming (MILP) model on conditional differential cryptanalysis of the nonlinear feedback shift register- (NLFSR-) based block ciphers is proposed, and an approach to detecting the bit with a strongly biased difference is provided. The model is successfully applied to the block cipher KATAN32 in the single-key scenario, resulting in practical key-recovery attacks covering more rounds than the previous. In particular, we present two distinguishers for 79 and 81 out of 254 rounds of KATAN32. Based on the 81-round distinguisher, we recover 11 equivalent key bits of 98-round KATAN32 and 13 equivalent key bits of 99-round KATAN32. The time complexity is less than 2 31 encryptions of 98-round KATAN32 and less than 2 33 encryptions of 99-round KATAN32, respectively. Thus far, our results are the best known practical key-recovery attacks for the round-reduced variants of KATAN32 regarding the number of rounds and the time complexity. All the results are verified experimentally.

Constructing de Bruijn Sequences Based on a New Necessary Condition

In this paper, we propose a new necessary condition for feedback functions of de Bruijn sequences and discuss its application in constructing de Bruijn sequences. It is shown that a large number of de Bruijn sequences could be easily constructed by precomputing an [Formula: see text]-stage nonlinear feedback shift register (NFSR) with a special cycle structure—that is, if a state [Formula: see text] is on a cycle generated by this NFSR, then all the states with the same Hamming weight as [Formula: see text] are also on this cycle. Moreover, if there are [Formula: see text] different cycles in the state graph of the precomputed NFSR, then we can construct [Formula: see text] de Bruijn sequences by the different choices of conjugate state pairs, where [Formula: see text].

On Equivalence of Cascade Connections of Two Nonlinear Feedback Shift Registers

Grain is a hardware-oriented finalist in the eSTREAM Stream Cipher Project. As a particular Galois nonlinear feedback shift register (NFSR), cascade connection of two NFSRs has been used as the main building block in the Grain family of stream ciphers. Two NFSRs are said to be equivalent if their sets of output sequences are equal. Finding properties of equivalent cascade connections of two NFSRs is useful to the design of the Grain family of stream ciphers. This paper first gives some properties of feedback functions between equivalent cascade connections of two NFSRs. It then shows that a cascade connection of two NFSRs and its equivalent Galois NFSR have isomorphic state diagrams if they have the same stage number. Finally, the paper reveals that for any given cascade connection of an $m$-stage NFSR1 into an $n$-stage NFSR2, there is only another one equivalent cascade connection of an $m$-stage NFSR3 into an $n$-stage NFSR4; moreover, the feedback functions of NFSR1 and NFSR3 are dual complementary, and the feedback functions of NFSR2 and NFSR4 are complementary. As an application of this property, the paper shows that the existing Grain family of stream ciphers have used the ones with lower cost of hardware implementations between their own two equivalent cascade connections, confirming their good design criteria.

Generation of special form shift registers using a dedicated software platform

This article describes crucial functionalities of a Unified Framework for Nonlinear Feedback Shift Register Generation (UFfNG). The core of UFfNG framework is a unified algorithm for Nonlinear Feedback Shift Registers (NLFSR) enumeration which can be effectively implemented in heterogeneous environments including CPUs, GPUs and FPGAs. For the sake of completeness, implementation and efficiency results for each platform are discussed and presented.