Cryptography: Linear Feedback Shift Register

Thank you, very well explained

should not b5 be (b1 exor b2) exor b4?
then (1+0)+1=(1+1)=0 for the 3rd equation? please clarify.

Great video, like the concept of using the hat example at first.

For what it's worth, I personally find the explanation at the end with XORs and registers much more clear than the analogy with the hats and the faces. Depends on one's background I guess.

How does LFSR(3,4) looks like? It is supposed to be ML-LFSR. I have an exercise to do but have no idea what (3,4) means? pls help

The only thing I don't understand is how to know which bits are being XORed. What if i have 7 bits? Or 40 bits? How will i know which ones to XOR?

Thanks for the vid, you made my midterm prep slightly easier :)

Great example and explanation. You made it extremely easy and intuitive! Kudos

PERFECT

oh guy you've saved me

very intuitive! thank you

Homework - LFSR
Given the initial 8-bit Linear Feedback Shift Registers (LFSR) 10110011, and the primitive polynomial x7 + x2+1. Generate a keystream of a sufficient length that could be used to encrypt and decrypt your “First Name”

this video helped me a lot

Thank you so much! This helps a lot for me to understand the assignment I need to do TvT

the teaching style I have been looking for all my life. this is the best.

thank you so much!!!!

Simple and straightforward 👍🏾

Kshlerin Throughway

Rudy Wall

Fanny Shore

Thank you so much for this!