Session
Management, Business and Economics
Description
The Diffie-Hellman protocol was proposed by Whitfield Diffie and Martin Hellman. Diffie and Hellman wanted a mathematical function where encryption and decryption would not be important, ie �(�(�))=�(�(�)). Such functions exist, but most are two-way, ie finding inverse functions is easy work eg. such a function is � (�) = 2�.
A practical example of these functions is the electrical switch. However, these functions are not usable in cryptography. Important are the concrete forms of so-called one-way functions. These problem functions appear to find their inverse functions, which are found through complex procedures. So for a given � we can easily compute �(�), but for given �(�) it is difficult to measure �, but if the secret value is known, then both the direct value and the inverse value are easily counted. Modular arithmetic means the presence of a large number of such one-time functions. So we will explore in this section for finding such functions.
Keywords:
One-way, inverse, encryption, DH protocol
Session Chair
Besnik Skenderi
Session Co-Chair
Mirjeta Domniku
Proceedings Editor
Edmond Hajrizi
ISBN
978-9951-437-69-1
First Page
67
Last Page
71
Location
Pristina, Kosovo
Start Date
27-10-2018 3:15 PM
End Date
27-10-2018 4:45 PM
DOI
10.33107/ubt-ic.2018.329
Recommended Citation
Kabashi, Faton and Jusufi, Azir, "Use composite commutation functions in determining the Diffie-Hellman keys" (2018). UBT International Conference. 329.
https://knowledgecenter.ubt-uni.net/conference/2018/all-events/329
Included in
Use composite commutation functions in determining the Diffie-Hellman keys
Pristina, Kosovo
The Diffie-Hellman protocol was proposed by Whitfield Diffie and Martin Hellman. Diffie and Hellman wanted a mathematical function where encryption and decryption would not be important, ie �(�(�))=�(�(�)). Such functions exist, but most are two-way, ie finding inverse functions is easy work eg. such a function is � (�) = 2�.
A practical example of these functions is the electrical switch. However, these functions are not usable in cryptography. Important are the concrete forms of so-called one-way functions. These problem functions appear to find their inverse functions, which are found through complex procedures. So for a given � we can easily compute �(�), but for given �(�) it is difficult to measure �, but if the secret value is known, then both the direct value and the inverse value are easily counted. Modular arithmetic means the presence of a large number of such one-time functions. So we will explore in this section for finding such functions.