Euler's Theorem | Cryptography And Network Security | Tutorials | Cryptography

preview_player
Показать описание
In this youtube channel we are going to teach you the basic concepts of Cryptography and Network Security.

In this video we have discussed about how to solve Euler's Theorem.

In this lecture we have taught about Euler's Theorem in Cryptography.


Follow Smit Kadvani on :-

Follow Dhruvan Tanna on :-

Follow Keyur Thakkar on :-

Snapchat :- keyur1610

Follow Ankit Soni on:-

Рекомендации по теме
Комментарии
Автор

I have some doubt if the problem given was 3^101 mod 23 where here n= 23 i.e 23 is a prime number i mean (23*1) -> (23-1)*(1-1)= 0 thereby 0<101 so the second version will be 3^ k*0*1 God... Or Euler's theorem doesn't work for prime number??

shyamsundar.r