Sensor networks with secure public-key over GF (2m)
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
| Hi-index | 0.00 |
Mobile and wireless devices like cell phones and network enhanced PDAs have become increasingly popular in recent years. The security of data transmitted via these devices has become the bottleneck for wireless network. Elliptic curves cryptography (ECC) is especially attractive for devices and is suited for wireless network, which has restrictions of the limited bandwidth, processing power, storage space and power consumption. The efficiency of ECC implementation is highly dependent on the performance of arithmetic operations of scalar multiplication(SM) dP, which mainly applied in encryption, signature and protocol. A new signed binary representation (SBR) for integers is proposed, which needs less memory and cost of computation compared to other methods mentioned in this paper. According to analyzing and comparing to other methods, algorithm for computing dP using new SBR is more efficient in window methods and is the simplest for applying in software and hardware. The new SBR needs less computational power and memory and can improve the security of wireless network efficiently.