Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings: Advanced Communication Technology (ICACT), 2010 the 12th International Conference |
| Place of Publication | Washington, DC, USA |
| Publisher | IEEE, Institute of Electrical and Electronics Engineers |
| Pages | 1226-1230 |
| Number of pages | 5 |
| Volume | 2 |
| ISBN (Print) | 9781424454273 |
| Publication status | Published - 2010 |
| Event | 2010 12th International Conference on Advanced Communication Technology (ICACT) - Gangwon-Do, Korea, Republic of Duration: 7 Feb 2010 → 10 Feb 2010 |
Conference
| Conference | 2010 12th International Conference on Advanced Communication Technology (ICACT) |
|---|---|
| Country | Korea, Republic of |
| City | Gangwon-Do |
| Period | 7/02/10 → 10/02/10 |
Fingerprint
Cite this
}
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 Book › Conference 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 -