A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
An Arithmetic over GF (2^5) Tt Implement in ECC
International Journal of Computer Applications
The potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized by Diffe and Hellman in 1976. Although the discrete logarithm problem as first employed by them was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups. The resulting publickey systems provide relatively smalldoi:10.5120/4863-7204 fatcat:56inlvstc5gmton2hmvxrba4bm