No abstract

No abstract

The Diffie-Hellman protocol was proposed by Whitfield and Martin Hellman. Diffie and Hellman wanted a mathematical function where encryption and decryption would not be important, ie (()) =. Such functions exist, but mostly 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. The most important are the concrete forms of so-called one-way functions. These 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 onetime functions. So in this section we will explore to find such functions.