Видео

While 63 is the theoretical max for this problem, given an ideal LFSR, it can be shown that the maximum would be no more than 8 for the one in this particular problem. Given: s[i] = s[i-2] ⊕ s[i-4] ⊕ s[i-6] And rules for xor operations: X ⊕ X = 0 0 ⊕ Y = Y s0 = a s1 = b s2 = c s3 = d s4 = e s5 = f s6 = a ⊕ c ⊕ e s7 = b ⊕ d ⊕ f s8 = c ⊕ e ⊕ (a ⊕ c ⊕ e) = a s9 = d ⊕ f ⊕ (b ⊕ d ⊕ f) = b s10 = e ⊕ (a ⊕ c ⊕ e) ⊕ a = c s11 = f ⊕ (b ⊕ d ⊕ f) ⊕ b = d s12 = (a ⊕ c ⊕ e) ⊕ a ⊕ c = e s13 = (b ⊕ d ⊕ f) ⊕ b ⊕ d = f s8-13 match the starting values of s0-s5. Therefore, no matter what sequence is given for s0-s5, this is guaranteed to repeat by s8. That gives this a maximum sequence length of 8.

Crystall clear

when binary starting number is one...then how to start? ex: 60 ^ 29mmod 133 29 binary value-11101

How to calculate the square of 627 under mod 941

240 power 1783 mod 3233 calculate this

Thank you so much, your method is the best!!!

Thanks so much for this method! This made my life a lot easier! Is there a similar method for fast exponentiation that is NOT modular? Like 240^262, NOT 240^262 mod 14? I know a method to do fast exponentiation, but if there were a method that made processing easier, like this method, that would be awesome. Either way, thanks!

😮

😮

Thank you thank you thank you mam i have seen alot of videos but can not understand this concept and your single video clear all my concepts...

thanks. great explain. I appreciate it

you're the best

what is the teacher name???

it's mod 2 not 6

got it.

Love you😅❤

thanks a lot, that was super helpful

Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.

Is this work for all numbers

is it d=23

Thank you!

ITS WORK

where can i find this book?

Thanks a lot . but I have a question . question is 7 level from which node to start ? whether each node should be checked

Thank you for making my life so much easier. I needed and example of an input and output from the f-function to test my program and you my friend are the only one I could find

thanks

How 4 mod 353 = 4 ?

This is by far the best explanation of this topic.....thank you so much

fermats theorem can be applicable?

but the crt ans is 248?

0 xor 0 = 1 ?

very effective and easy method of solving mod as compared to the binary converstion one

Thank you mam

Answer should be 4. But you said it's 2.why?

How 2^2 mod 14 is 4?

Hello ma'am Can you continue this series by solving more advanced topics on discretion log and etc There are only a few youtubers out there who solve these topics and this would bring a lot of subscribers for you please ma'am I would be waiting for it Thank you:)

Love you Susan zehra thank you❤

its 2

you made this concept ,crystal clear to me ☺thank you ma'am

Excellent explanation.

Thank you ma'am such an excellent explanation.

Finally i found the way to calculate it thx a lot

Thank you so much 🙏, i could've never wrapped my head around it if it wasn't for your videos

in google the final answer is showing 4 and yours 2 what to do now? which one is correct

It’s not correct

Very helpful for me,thanks!

HOW TO COMPUTE 1819¹³ MOD 2537

Brilliant video.

Great method...plz make video on if calculate modulo of negative power

Thankyou Ma'am, May Allah Bless you