Searching short recurrences of nonlinear shift registers via directed acyclic graphs

Authors:
Lin Wang;Bing Shen;TongXu Qiao
Affiliations:
Science and Technology on Communication Security Laboratory, Chengdu, Sichuan, P.R. China;Science and Technology on Communication Security Laboratory, Chengdu, Sichuan, P.R. China;No.30 Institute of CETC, Chengdu, Sichuan, P.R. China
Venue:
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2011

Citing 9
Cited 0

Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Introduction to algorithms

Introduction to algorithms
The Design of Rijndael

The Design of Rijndael
Shift Register Sequences

Shift Register Sequences
Modes of Operation of Stream Ciphers

SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Trivium

New Stream Cipher Designs
Graph Theory

Graph Theory
A transformation from the Fibonacci to the Galois NLFSRs

IEEE Transactions on Information Theory
An algorithm for constructing a fastest Galois NLFSR generating a given sequence

SETA'10 Proceedings of the 6th international conference on Sequences and their applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding a recurrence of a shift register gives its equivalent shift register in Fibonacci configuration and hence helps to decide whether different nonlinear shift registers are equivalent, i.e., whether they generate the same set of output sequences. We define a dependence graph of a shift register and it is a directed acyclic graph related to the shift register. We show that existence of a dependence graph with a special property of a nonlinear shift register ensures existence of a short recurrence of the sequence generated by the nonlinear shift register. We also present an algorithm to search dependence graphs of a nonlinear shift register.