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

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

    Forskningsoutput: Kapitel i bok/konferenshandlingKonferensbidragVetenskapligPeer review

    6 Citeringar (Scopus)

    Sammanfattning

    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.

    OriginalspråkOdefinierat/okänt
    Titel på värdpublikation2016 International Conference on High Performance Computing & Simulation (HPCS)
    FörlagIEEE
    Sidor
    ISBN (elektroniskt)978-1-5090-2088-1
    DOI
    StatusPublicerad - 2016
    MoE-publikationstypA4 Artikel i en konferenspublikation
    EvenemangInternational Conference on High Performance Computing & Simulation (HPCS) - 2016 International Conference on High Performance Computing & Simulation (HPCS)
    Varaktighet: 18 maj 201622 juli 2016

    Konferens

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

    Citera det här