Modular arithmetic query
Apologies if this is very basic. Could anyone tell me why
[TEX](g^{a}\ mod\ p) \cdot (g^{b}\ mod\ p) \ mod\ p\equiv g^{(a+b)\ mod\ (p1)}\ mod\ p[/TEX] 
Because: [url]https://en.wikipedia.org/wiki/Euler%27s_theorem[/url]

Right. I got that far but couldn't make the connection. How do I get from the totient function to (a+b) mod (p1)?

[QUOTE=garo;547440]Right. I got that far but couldn't make the connection. How do I get from the totient function to (a+b) mod (p1)?[/QUOTE]For primes the totient function is simply p1. So multiples of p1 in the exponent can be ignored.

Gotcha. Thanks for your help. Not sure why I was making it more complicated in my head.

All times are UTC. The time now is 22:15. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.