Why Fibonacci LFSR random number generation works?

345 Views Asked by At

If I use primitive polynomial of GF($2^m$) in Fibonacci LFSR, it is generating all m-length binary combinations. But, I cannot understand why this should happen. I am not getting any mathematical explanation regarding this problem. Can somebody give me some reasoning?