Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point

Xu Huang, Pritam Shah, Dharmendra Sharma

    Research output: A Conference proceeding or a Chapter in BookConference contribution

    7 Citations (Scopus)

    Abstract

    Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-inmiddle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5% improvement in efficiency in comparison with the results of other common complementary algorithms reported.
    Original languageEnglish
    Title of host publicationProceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.
    Place of PublicationWashington, DC, USA
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages243-249
    Number of pages7
    Volume1
    ISBN (Print)9780769542355
    DOIs
    Publication statusPublished - 2010
    EventCyberC 2010: The Second International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery - Huangshan, China
    Duration: 10 Oct 201012 Oct 2010

    Conference

    ConferenceCyberC 2010: The Second International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery
    CountryChina
    CityHuangshan
    Period10/10/1012/10/10

    Fingerprint

    Sensor networks
    Cryptography
    Wireless networks
    Availability
    Bandwidth
    Data storage equipment
    Communication
    Sensors

    Cite this

    Huang, X., Shah, P., & Sharma, D. (2010). Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point. In Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010. (Vol. 1, pp. 243-249). Washington, DC, USA: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/CyberC.2010.51
    Huang, Xu ; Shah, Pritam ; Sharma, Dharmendra. / Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point. Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.. Vol. 1 Washington, DC, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. pp. 243-249
    @inproceedings{85f4650ee30940eda1461f2a413d5311,
    title = "Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point",
    abstract = "Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-inmiddle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5{\%} improvement in efficiency in comparison with the results of other common complementary algorithms reported.",
    author = "Xu Huang and Pritam Shah and Dharmendra Sharma",
    year = "2010",
    doi = "10.1109/CyberC.2010.51",
    language = "English",
    isbn = "9780769542355",
    volume = "1",
    pages = "243--249",
    booktitle = "Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    address = "United States",

    }

    Huang, X, Shah, P & Sharma, D 2010, Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point. in Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.. vol. 1, IEEE, Institute of Electrical and Electronics Engineers, Washington, DC, USA, pp. 243-249, CyberC 2010: The Second International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, Huangshan, China, 10/10/10. https://doi.org/10.1109/CyberC.2010.51

    Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point. / Huang, Xu; Shah, Pritam; Sharma, Dharmendra.

    Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.. Vol. 1 Washington, DC, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. p. 243-249.

    Research output: A Conference proceeding or a Chapter in BookConference contribution

    TY - GEN

    T1 - Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point

    AU - Huang, Xu

    AU - Shah, Pritam

    AU - Sharma, Dharmendra

    PY - 2010

    Y1 - 2010

    N2 - Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-inmiddle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5% improvement in efficiency in comparison with the results of other common complementary algorithms reported.

    AB - Cryptographic algorithms are becoming popular due to their applicability and suitability for use in constrained environment such as mobile sensor information applications. It is well known in these applications, both computing resources and power availability are limiting factors. Hence, it is expecting to have cryptographic algorithms with low power consuming, less computing, and high security for mobile sensor networks. Elliptic curve cryptography (ECC) is an emerging favorite because requires less computational power, communication bandwidth, and memory when compared to other cryptosystems. In this paper we present our new design, a hidden generator point, which offers an improvement in protection from the man-inmiddle (MinM) attack which is a major vulnerability for the sensor networks. Even though there are other ways to implement hidden generator point, which are on the way to be published in our future paper, the presented algorisms can show the hidden generator point does work. Also, a new algorithm based on ones complement for fast scalar multiplication is first introduced, which yields a 12.5% improvement in efficiency in comparison with the results of other common complementary algorithms reported.

    U2 - 10.1109/CyberC.2010.51

    DO - 10.1109/CyberC.2010.51

    M3 - Conference contribution

    SN - 9780769542355

    VL - 1

    SP - 243

    EP - 249

    BT - Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.

    PB - IEEE, Institute of Electrical and Electronics Engineers

    CY - Washington, DC, USA

    ER -

    Huang X, Shah P, Sharma D. Fast scalar multiplication for elliptic curve cryptography in sensor networks with hidden generator point. In Proceedings of IEEE International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery, 2010.. Vol. 1. Washington, DC, USA: IEEE, Institute of Electrical and Electronics Engineers. 2010. p. 243-249 https://doi.org/10.1109/CyberC.2010.51