On Assurance of Information Security using Elliptic Curves Cryptosystems

We present in this paper an important area of information security emerged in the last decades, namely Elliptic Curves Cryptosystems (ECC). Compared to traditional public-key cryptosystems like RSA or Diffie-Hellman, ECC offers equivalent security with smaller key sizes; these result in faster computations, lower power consumption, as well as memory and bandwidth savings. ECC are more and more considered as an attractive public-key cryptosystem for mobile/wireless environments. ECC are especially useful for mobile devices, which are typically limited in terms of their CPU, power and network connectivity. ECC are the next frontier in the use of security mechanisms by providing good security margins with lower computational cost. ECC's domain is an important field emerged in information security. The elliptic curves (EC) are used for conceiving efficient factorization algorithms and for proving the primality. They are used in public key cryptosystems and in pseudorandom bit generators, too. The elliptic curves were also applied in Codes Theory, where they were used to create very good error protected codes. In this paper, our aim is to examine the security, implementation and performance of ECC applications on various mobile devices. Also, our goal is to compare ECC and conventional PKC performances. Doing these, we want to prove that ECC could become the next-generation of PKC.