文章基本信息

标题：A Montgomery Representation of Elements in GF(25) for Efficient Arithmetic to Use in Elliptic Curve Cryptography
本地全文：下载
作者：A.R.Rishivarman ; B.Parthasarathy ; M.Thiagarajan 等
期刊名称：International Journal of Advanced Networking and Applications
电子版ISSN：0975-0290
出版年度：2010
卷号：1
期号：5
页码：324-327
出版社：Eswar Publications
摘要：Elliptic curve calculation was not introduced to cryptography until 1985. Compared with RSA, the advantage of elliptic curve cryptography lies in its ensuring the same security while the length of key of elliptic curve cryptography is much less than RSA cryptography and its lessening operation load. In this article a change of representation for elements in GF(25) is proposed to use in elliptic curve cryptography. The proposed representation is useful for architectures that implement Montgomery multiplication in the finite field GF(25). In fact, it needs virtually no cost in terms of conversion operations from a standard
关键词：Montgomery multiplications; finite field; elliptic curve cryptography (ECC); GF(2;5;); irreducible