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

Research output: A Conference proceeding or a Chapter in BookConference contributionpeer-review

12 Citations (Scopus)
89 Downloads (Pure)

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
Subtitle of host publicationICT for Green Growth and Sustainable Development, ICACT 2010 - Proceedings
Place of PublicationWashington, DC, USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1226-1230
Number of pages5
Volume2
ISBN (Print)9781424454273
Publication statusPublished - 2010
Event12th International Conference on Advanced Communication Technology: ICT for Green Growth and Sustainable Development, ICACT 2010 - , Korea, Republic of
Duration: 7 Feb 201010 Feb 2010

Publication series

NameInternational Conference on Advanced Communication Technology, ICACT
Volume2
ISSN (Print)1738-9445

Conference

Conference12th International Conference on Advanced Communication Technology: ICT for Green Growth and Sustainable Development, ICACT 2010
Country/TerritoryKorea, Republic of
Period7/02/1010/02/10

Fingerprint

Dive into the research topics of 'Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)'. Together they form a unique fingerprint.

Cite this