Miller Rabin Primality test steps with example in Cryptography Solved example to check prime numbers

[@tmssengineeringcollege6080]

Thanks Apu for such nice explanation

[@CSEconceptswithParinita]

Keep learning, keep sharing ✌ 😊

[@aashancoding3034]

Very helpful tutorial...

[@CSEconceptswithParinita]

Thanks for your feedback 😊

[@pankajahakey722]

Mam how 25*8=234?

[@nadeemsatti8791]

overall good work

[@CSEconceptswithParinita]

Glad you liked it! Keep learning, keep sharing 😊

[@SanjaySingh-ud5ju]

Thank you madam. Your videos made me understand all the concepts of cryptography 💥💥

[@CSEconceptswithParinita]

I'm glad to know that 😊😊

[@tejeshwarrao4239]

Super explanation

[@CSEconceptswithParinita]

Thank you for the acknowledgement 😊

[@niveditahajra9325]

Very clear👍

[@CSEconceptswithParinita]

Thanks for supporting😊

[@tanaydwivedi1724]

Maam would we be getting value of k other than 1 as even numbers are always divisible by 2 and their is no logic to check prime for even numbers

[@qaisazam445]

Thank you :)

[@CSEconceptswithParinita]

My pleasure 😊

[@shubhammishra-rl4jz]

So it is always a case k=1 when we take any prime number...
Bcz prime no are odd(expect 2) and when we taking n-1 it is always give us even number...
So n-1 = m*2^k...
m and k in every case
m=n-1/2 and k=1..

[@Farzistan]

thankyou mam

[@CSEconceptswithParinita]

My pleasure 😊 Keep learning, keep supporting 💯

[@coopergates9680]

If k > 1, you may need to perform both tests. Primes will yield T == +-1 (mod n) or a successive square of T will be == -1 (mod n).
Also, the M-R test is a compositeness test. n passing the test for base a means n is a strong probable prime to base a, but not a guaranteed prime. Base 2 is a strong liar for 2047 and infinitely many other composites.

[@sudiptahajra8974]

nice explaination

[@CSEconceptswithParinita]

Thanks for the acknowledgement 😊

[@_Kirti_Khollam]

sister atleast give the link of the previous video that you are refering in your description.

[@CSEconceptswithParinita]

Sure, will take care next time 🙂

[@_Kirti_Khollam]

@@CSEconceptswithParinita yes sister. btw , all the videos are so awesome. Yesterday i was watching them. Thank you so much for such an awesome explanation. Keep going 💯💯💯💯💯💯💯💯💯💯💯

[@CSEconceptswithParinita]

I'm glad to know that✌ Keep learning, keep sharing 😊

[@usmankhan-wf9mh]

what if we get value of a other than 2?

[@CSEconceptswithParinita]

Even if the value of a is anything other than 2, we have to carry out the same procedure

[@RiteshYadav-fs5fd]

What when k=2

[@sunyulhossen]

What is 'a' ?

[@ascensioninfotech1385]

if k=2 then how we find

[@coopergates9680]

There are up to k modular comparisons. T == +-1 (mod n) is still the first test, and if a prime does not pass that part, it will yield a remainder of -1 in one of the remaining k-1 checks. The remainder is squared and modded with n to get each next comparison.

[@shreenidhibodas9816]

That's Okay and everything...but 25 * 8 :))))

[@pankajahakey722]

Bro u get ? 😅

[@subhalaxmisatapathy7521]

Jisko 25*8 nhi aata usko kya hi bolna aur

[@coopergates9680]

I don't know how someone would write a number that's clearly not divisible by 5 or 8 lol

[@srimantmishra2985]

Prepare well before making the vedio. Overall performance is alright 👍

[@CSEconceptswithParinita]

Thanks for your feedback!

[@srimantmishra2985]

@@CSEconceptswithParinita Hey can you make a video on Schoof's point counting algorithm tomorrow, because I have my exam on Computational Number Theory the day after tomorrow and I'm unable to find any proper explanation over that !