Great explanation. Now, if Bob wants to send a message to Alice, how does he encrypt it? This may be a dumb question, but I'm not sure where the message fits in here. What am I missing?
An example of an even higher prime number would be more useful to see and the anology on it. something like n = 101 or something like that and g be like 27
I think the hacker needs to get the larger exchanged result in this case 10, 2 are obtained and the hacker going to select 10 and can find the secrete key by having his/her own key starting from 7 like 7,11,13,17..... just use the formula as bob and alliance 10pow7,11,13,...., mod 11 is always 10! so, the exchanged key also keep as a secret. the tutorial is so amazing and wonderful!