“…Here, we investigate N-bit LFSR with N ≤ 8. Concretely, we try (1, 0), (2, 1, 0), (3, 1, 0), (4, 1, 0), (7,1,0), and (7, 3, 0) LFSRs, where listing (1, 0) means that a new bit is generated by XORing a shifted bit with the next bit, and listing (7, 1, 0) means that a seven times shifted bit and a shifted bit are XORed with the next bit, and so on. Figure 5 shows (2, 1, 0)-LFSR and (3, 1, 0 …”