2000 character limit reached
Finding matching initial states for equivalent NLFSRs in the fibonacci and the galois configurations
Published 18 Mar 2009 in cs.CR | (0903.3182v1)
Abstract: In this paper, a mapping between initial states of the Fibonacci and the Galois configurations of NLFSRs is established. We show how to choose initial states for two configurations so that the resulting output sequences are equivalent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.