Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)

Xu Huang, Dharmendra Sharma, Pritam Shah

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

    8 Citations (Scopus)

    Abstract

    Elliptic curve cryptosystems have been the focus of much attention as the benefits of elliptic curve cryptography (ECC) become many such as a small software footprint, low hardware implementation costs, linear scalability, low bandwidth requirements, and high performance, which have been drawn great attentions in particular wireless sensor networks. Many papers have investigated various algorithms for fast calculations due to the wireless sensor networks are always limited power energy, constrict computing capacity, and other tighten resources such as storage capacity limited, etc. In this paper a novel algorithm is first presented, with which the hamming weight will be minimized therefore the calculation cost will be dropped and the cryptographic algorithm has gained the natures of ECC. This makes ECC more suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. The final results show that, in comparison with popular algorithms, such as NAF, MOF and complementary algorithms, the proposed algorithm significantly improved (average about 12.5% decreasing comparing with complementary algorithms).
    Original languageEnglish
    Title of host publicationProceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference
    Place of PublicationWashington, DC, USA
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages1226-1230
    Number of pages5
    Volume2
    ISBN (Print)9781424454273
    Publication statusPublished - 2010
    Event2010 12th International Conference on Advanced Communication Technology (ICACT) - Gangwon-Do, Korea, Republic of
    Duration: 7 Feb 201010 Feb 2010

    Conference

    Conference2010 12th International Conference on Advanced Communication Technology (ICACT)
    CountryKorea, Republic of
    CityGangwon-Do
    Period7/02/1010/02/10

    Fingerprint

    Cryptography
    Wireless sensor networks
    Scalability
    Costs
    Availability
    Hardware
    Bandwidth
    Sensors

    Cite this

    Huang, X., Sharma, D., & Shah, P. (2010). Minimizing hamming weight based on 1's complement of binary numbers over GF(2m). In Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference (Vol. 2, pp. 1226-1230). Washington, DC, USA: IEEE, Institute of Electrical and Electronics Engineers.
    Huang, Xu ; Sharma, Dharmendra ; Shah, Pritam. / Minimizing hamming weight based on 1's complement of binary numbers over GF(2m). Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference. Vol. 2 Washington, DC, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. pp. 1226-1230
    @inproceedings{613b24f94945496ca557251e04cd53eb,
    title = "Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)",
    abstract = "Elliptic curve cryptosystems have been the focus of much attention as the benefits of elliptic curve cryptography (ECC) become many such as a small software footprint, low hardware implementation costs, linear scalability, low bandwidth requirements, and high performance, which have been drawn great attentions in particular wireless sensor networks. Many papers have investigated various algorithms for fast calculations due to the wireless sensor networks are always limited power energy, constrict computing capacity, and other tighten resources such as storage capacity limited, etc. In this paper a novel algorithm is first presented, with which the hamming weight will be minimized therefore the calculation cost will be dropped and the cryptographic algorithm has gained the natures of ECC. This makes ECC more suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. The final results show that, in comparison with popular algorithms, such as NAF, MOF and complementary algorithms, the proposed algorithm significantly improved (average about 12.5{\%} decreasing comparing with complementary algorithms).",
    author = "Xu Huang and Dharmendra Sharma and Pritam Shah",
    year = "2010",
    language = "English",
    isbn = "9781424454273",
    volume = "2",
    pages = "1226--1230",
    booktitle = "Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    address = "United States",

    }

    Huang, X, Sharma, D & Shah, P 2010, Minimizing hamming weight based on 1's complement of binary numbers over GF(2m). in Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference. vol. 2, IEEE, Institute of Electrical and Electronics Engineers, Washington, DC, USA, pp. 1226-1230, 2010 12th International Conference on Advanced Communication Technology (ICACT), Gangwon-Do, Korea, Republic of, 7/02/10.

    Minimizing hamming weight based on 1's complement of binary numbers over GF(2m). / Huang, Xu; Sharma, Dharmendra; Shah, Pritam.

    Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference. Vol. 2 Washington, DC, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. p. 1226-1230.

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

    TY - GEN

    T1 - Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)

    AU - Huang, Xu

    AU - Sharma, Dharmendra

    AU - Shah, Pritam

    PY - 2010

    Y1 - 2010

    N2 - Elliptic curve cryptosystems have been the focus of much attention as the benefits of elliptic curve cryptography (ECC) become many such as a small software footprint, low hardware implementation costs, linear scalability, low bandwidth requirements, and high performance, which have been drawn great attentions in particular wireless sensor networks. Many papers have investigated various algorithms for fast calculations due to the wireless sensor networks are always limited power energy, constrict computing capacity, and other tighten resources such as storage capacity limited, etc. In this paper a novel algorithm is first presented, with which the hamming weight will be minimized therefore the calculation cost will be dropped and the cryptographic algorithm has gained the natures of ECC. This makes ECC more suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. The final results show that, in comparison with popular algorithms, such as NAF, MOF and complementary algorithms, the proposed algorithm significantly improved (average about 12.5% decreasing comparing with complementary algorithms).

    AB - Elliptic curve cryptosystems have been the focus of much attention as the benefits of elliptic curve cryptography (ECC) become many such as a small software footprint, low hardware implementation costs, linear scalability, low bandwidth requirements, and high performance, which have been drawn great attentions in particular wireless sensor networks. Many papers have investigated various algorithms for fast calculations due to the wireless sensor networks are always limited power energy, constrict computing capacity, and other tighten resources such as storage capacity limited, etc. In this paper a novel algorithm is first presented, with which the hamming weight will be minimized therefore the calculation cost will be dropped and the cryptographic algorithm has gained the natures of ECC. This makes ECC more suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. The final results show that, in comparison with popular algorithms, such as NAF, MOF and complementary algorithms, the proposed algorithm significantly improved (average about 12.5% decreasing comparing with complementary algorithms).

    M3 - Conference contribution

    SN - 9781424454273

    VL - 2

    SP - 1226

    EP - 1230

    BT - Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference

    PB - IEEE, Institute of Electrical and Electronics Engineers

    CY - Washington, DC, USA

    ER -

    Huang X, Sharma D, Shah P. Minimizing hamming weight based on 1's complement of binary numbers over GF(2m). In Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference. Vol. 2. Washington, DC, USA: IEEE, Institute of Electrical and Electronics Engineers. 2010. p. 1226-1230