Software Implementations of Elliptic Curve Cryptography
نویسندگان
چکیده
Elliptic Curve Cyrptography has gained a lot of significance in recent times. This is mostly due to the small key sizes associated with Elliptic Curve Cryptograhic systems. This paper presents a study of various algorithms for performing underlying field arithmetic and point representation useful in software implementations of Elliptic curve cyptography over prime fileds as well as binary fields.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملSoftware Implementations of Elliptic Curve Cryptography
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much shorter keys than conventional integer-based public-key algorithms. ECC over binary field is of special interest because the operations in binary field are thought more space and time efficient. However, the software imp...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملA Comprehensive and Comparative Study of Elliptic Curve Cryptography Hardware Implementations for WSN
Key management and authentication are essential modules for network security provisioning especially for Wireless Sensor Networks (WSN). Make available these two services by using symmetric cryptosystems in software implementation are challenging that’s not providing a perfect trade-off between resilience and performance. Asymmetric approaches with public key cryptosystems, specifically Ellipti...
متن کامل