This question already has an answer here:
- How do I compute $a^b\,\bmod c$ by hand? 9 answers
I am not so good at Mathematics so please kindly forgive my stupidity.
Basically, I am learning modular arithmetic for cryptography and so I am struggling in understanding how to do big modular arithmetic calculation without a calculator.
So for example, how would I do this question:
6^56 mod 19?
I get that you need to convert the power
56 into binary - so that would be
0111000. So like
I then understand you have to do like:
6^8 mod 19 then
6^16 mod 19 and
6^32 mod 19.
I've been told I can use the chinese remainder theorem - but I want to know how to do this all.
Any help would be absolutely great! I like this stuff but I have been struggling a bit.