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”
I know Im asking the wrong place but does any of you know a tool to log back into an Instagram account? I stupidly forgot my login password. I would appreciate any assistance you can offer me.
@Elliot Jerome thanks so much for your reply. I got to the site thru google and I'm trying it out now. Takes a while so I will get back to you later with my results.
@@erekleshatirishvili1465 სად მომაგნე ლმაო. იუთუბზე მეგონა რო ანონიმური ვიყავი. თან ძაან კარგი რამე კი ქენი. დღეს სულ დამავიწყდა რო ბოლომდე მიმეყვანა ეს დავალება.
@@gshengelaia2001 დაიკიდე გადაწია დედლაინი მაინც :დდდ დავწერე ესეც მარა არ მომწონდა რენდომობის კუთხით სულ იგივეს რო აგდებდა და მეთქი რამეს ვნახავ სადმეთქო მარა ქლოქის გარეშე ვერ ვშვები :დდდ
Hi, thanks for asking this question. I believe you're talking about the example that starts at 7:35. With regards to grouping b_1 and b_2, it turns it that it's not important. Like normal addition, the order in which you XOR bits together does not impact the result. For example: (1 + 0) + 1 = 1 + (0 + 1) = (1 + 1) + 0, etc. From reading your comment, it looks like you've correctly added the bits stored to b_1, b_2, and b_4 in the third iteration to get the correct value of 0. That result means that b_5 will take on the value of 0 in the next iteration of the LFSR, as indicated in the 4th row of the table. Hope that clarifies!
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.
the teaching style I have been looking for all my life. this is the best.
Great video, like the concept of using the hat example at first.
Great example and explanation. You made it extremely easy and intuitive! Kudos
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”
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?
i think some mathematician proved it, but theres a specific sequence for any # of bits your LSFR handles
Thank you so much for this!
Simple and straightforward 👍🏾
Thanks for the vid, you made my midterm prep slightly easier :)
I know Im asking the wrong place but does any of you know a tool to log back into an Instagram account?
I stupidly forgot my login password. I would appreciate any assistance you can offer me.
@Bishop Gianni instablaster :)
@Elliot Jerome thanks so much for your reply. I got to the site thru google and I'm trying it out now.
Takes a while so I will get back to you later with my results.
@@bishopgianni9214 cummyy peepee poo poo
@Elliot Jerome It did the trick and I finally got access to my account again. I am so happy!
Thanks so much you saved my ass :D
Thank you, very well explained
very intuitive! thank you
Very intuitive indeed! Thank you George
@@erekleshatirishvili1465 სად მომაგნე ლმაო. იუთუბზე მეგონა რო ანონიმური ვიყავი. თან ძაან კარგი რამე კი ქენი. დღეს სულ დამავიწყდა რო ბოლომდე მიმეყვანა ეს დავალება.
@@gshengelaia2001 დაიკიდე გადაწია დედლაინი მაინც :დდდ დავწერე ესეც მარა არ მომწონდა რენდომობის კუთხით სულ იგივეს რო აგდებდა და მეთქი რამეს ვნახავ სადმეთქო მარა ქლოქის გარეშე ვერ ვშვები :დდდ
this video helped me a lot
thank you so much!!!!
Thank you so much! This helps a lot for me to understand the assignment I need to do TvT
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
should not b5 be (b1 exor b2) exor b4?
then (1+0)+1=(1+1)=0 for the 3rd equation? please clarify.
Hi, thanks for asking this question. I believe you're talking about the example that starts at 7:35. With regards to grouping b_1 and b_2, it turns it that it's not important. Like normal addition, the order in which you XOR bits together does not impact the result. For example: (1 + 0) + 1 = 1 + (0 + 1) = (1 + 1) + 0, etc. From reading your comment, it looks like you've correctly added the bits stored to b_1, b_2, and b_4 in the third iteration to get the correct value of 0. That result means that b_5 will take on the value of 0 in the next iteration of the LFSR, as indicated in the 4th row of the table. Hope that clarifies!
@@NCSSMgibson First example : Day 5 and Day 10 should be similar if only (b1 exor b2) . for girl with brown hair should have (b1 exor b2) exor b4
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.
PERFECT
oh guy you've saved me
Rudy Wall
Kshlerin Throughway
Fanny Shore