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

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

Thanks Apu for such nice explanation

if k=2 then how we find

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..

What is 'a' ?

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

Thank you :)

Mam how 25*8=234?

thankyou mam

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

Very helpful tutorial...

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

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

Very clear👍

what if we get value of a other than 2?

Super explanation

nice explaination