vanadium
Electrical
- Sep 6, 2001
- 5
Dear Expertists,
In Diffie-Hellman, the equation g^k mod p has to be calculated. p is a large prime number. g and k are integers less than p. Is there any fast and efficient algorithm to calculate the equation in a computer? The intermediate result g^k would be an extremely large number!
Your help will be highly appreciated.
In Diffie-Hellman, the equation g^k mod p has to be calculated. p is a large prime number. g and k are integers less than p. Is there any fast and efficient algorithm to calculate the equation in a computer? The intermediate result g^k would be an extremely large number!
Your help will be highly appreciated.
