Platform Independent Elliptic Curve Cryptography over
نویسنده
چکیده
Elliptic curve cryptography has long since moved into several wellknown standards like IEEE’s 1363, SEC and X9.62. With its small key sizes it is just right for many crypto applications, in particular for mobile computing and communication devices. To make ECC easily available for all these different applications, a highly efficient and platformindependent implementation of ECC is necessary. The efficiency of such an implementation depends on the choice of methods for point multiplication and the choice of point representation. Many different combinations are possible but only one for each ec-application leads to the best result. In this paper we present an highly efficient, platform-independent implementation for ec-signature generation, ec-signature verification and ec-key exchange. It only requires an additional storage of 2 MB and therefore is applicable also for small mobile devices. On the basis of extensive experiments we show, that in our implementation, algorithms and parameters are chosen such that the efficiency of each of above ec-applications is optimal.
منابع مشابه
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...
متن کامل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...
متن کاملTradeoff analysis of FPGA based elliptic curve cryptography
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studied how efficient several field multipliers can be mapped to lookup table based FPGAs. Furthermore we have compared different curve coordinate representations with respect to the number of required field operations, and ...
متن کاملProvably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کامل