期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2012
卷号：36
期号：1
页码：026-040
出版社：Journal of Theoretical and Applied
摘要：Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffe and Hellman 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 public � key systems provide relatively small block size, high speed, and high security. This paper explores an efficient performance of GF(25) in the normal basis representation and an elliptic curve cryptosystems using a non-super singular curve over the field; so this scheme is of less computation cost which is valuable in applications with limited memory, communications bandwidth or computing power.
