SEECC: A Secure and Efficient Elliptic Curve Cryptosystem for E-health Applications

Golnaz Sahebi, Amin Majd, Masoumeh Ebrahimi, Juha Plosila, Jaber Karimpour, Hannu Tenhunen

    Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

    3 Citations (Scopus)

    Abstract

    Security is an essential factor in wireless sensor networks especially for E-health applications. One of the common mechanisms to satisfy the security requirements is cryptography. Among the cryptographic methods, elliptic curve cryptography is well-known, as by having a small key length it provides the same security level in comparison with the other public key cryptosystems. The small key sizes make ECC very interesting for devices with limited processing power or memory such as wearable devices for E-health applications. It is vitally important that elliptic curves are protected against all kinds of attacks concerning the security of elliptic curve cryptography. Selection of a secure elliptic curve is a mathematically difficult problem. In this paper, an efficient elliptic curve selection framework, called SEECC, is proposed to select a secure and efficient curve from all the available elliptic curves. This method enhances the security and efficiency of elliptic curve cryptosystems by using a parallel genetic algorithm.

    Original languageUndefined/Unknown
    Title of host publication2016 International Conference on High Performance Computing & Simulation (HPCS)
    PublisherIEEE
    Pages
    ISBN (Electronic)978-1-5090-2088-1
    DOIs
    Publication statusPublished - 2016
    MoE publication typeA4 Article in a conference publication
    EventInternational Conference on High Performance Computing & Simulation (HPCS) - 2016 International Conference on High Performance Computing & Simulation (HPCS)
    Duration: 18 May 201622 Jul 2016

    Conference

    ConferenceInternational Conference on High Performance Computing & Simulation (HPCS)
    Period18/05/1622/07/16

    Cite this