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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Wang, L., Shen, B., & Qiao, T. (2012). Searching short recurrences of nonlinear shift registers via directed acyclic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7537 LNCS, pp. 44–56). Springer Verlag. https://doi.org/10.1007/978-3-642-34704-7_4
Mendeley helps you to discover research relevant for your work.