Hi all.
I'm learning cryptography (My native language is not English , so I hope you understand what I mean).
There are some problem with my learning : a , b , n are large integer(big integer) , we need a lot of bits for restoring them (their bits > 100)
1. Input : a , b , n
Write function in order to calculate : m = (a * b) % n
Output : m
2. Input : a , b, n
Write function in order to calculate : m = (a ^ b) %n
Output : m
3. After write these function , how we can test them(because they are very large)

Please help.