Is there a faster way (or even possible) to find the initial state of m-bit LFSR, if I know the part of the generated sequence?
Example: Given m=16, feedback polynomial as x^16 + x^12 + x^3 + x^1 + 1 and part of sequence is '0010100010000110010011100011100100001000110111000000011010001001100101110101001100000011111010111000100001101011101011011011101111110000000001111111010010110100001011000101011111100110101010001110000000'
Can we even find out what was the initial state of the LFSR?if we can, what is the minimum length of known sequence requred?
The example above has all ones as initial state and is generate using as follow:
import pylfsrL1 = pylfsr.LFSR(fpoly=[16,12,3,1], initstate='ones')seq = L1.runKCycle(2**16)seq = L1.arr2str(seq)Expecting: I am expecting anyone, who know how to write a program and code to get the initial state
