Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

Register Log in
  • Congratulations TugboatEng on being selected by the Eng-Tips community for having the most helpful posts in the forums last week. Way to Go!

Implementation of Diffie-Hellman

Status
Not open for further replies.
vanadium

vanadium

Electrical
Joined
Sep 6, 2001
Messages
5
Location
HK
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.
 
Sort by date Sort by votes
Find the power N of g which is larger than p. Calculate
g2= g^N mod P. Repeat with g2 etc...

<nbucska@pcperipherals.com>
 
Upvote 0 Downvote
Status
Not open for further replies.

Similar threads

U
  • Locked
  • Question Question
multicarrier Faster Than Nyquist implementation
Replies
0
Views
2K
Unkn0w0n
U
rumahhutan
  • Locked
  • Question Question
Maturity Level of SCADA
Replies
0
Views
1K
rumahhutan
rumahhutan
Simactricals
  • Locked
  • Question Question
Can the output of a BIBO stable positive feedback system grow more than its input?
Replies
0
Views
860
Simactricals
Simactricals
FMeyer
  • Locked
  • Question Question
Calculating PFA and PD of a radar system based on SNR
Replies
2
Views
853
IRstuff
IRstuff
ShaunV
  • Locked
  • Question Question
Standard set of test patterns for bit error rate testing of optical comms systems
Replies
0
Views
306
ShaunV
ShaunV

Part and Inventory Search

Sponsor

Back
Top