Abstract
Abstract—Elliptic curve cryptography (ECC) has been attractive to the people who are working in the field of the network security due to its good potential for wireless sensor network security due to its smaller key size and its high strength of security. But there is a room to reduce the key calculation time to meet the potential applications, in particular for wireless sensor networks (WSN). It is well known that scalar multiplication is the operation in elliptical curve cryptography which takes 80 % of key calculation time on wireless sensor network motes. In this paper, the research proposes algorithm based on 1’s complement subtraction to represent scalar in scalar multiplication which offer less Hamming weight and will remarkably improve the computational efficiency of scalar multiplication. Index Terms—Elliptic curve cryptography, Scalar
| Original language | English |
|---|---|
| Title of host publication | A U M L A |
| Place of Publication | Hong Kong, China |
| Publisher | International Association of Engineers (IAENG) |
| Pages | 818-822 |
| Number of pages | 5 |
| Volume | 2 |
| ISBN (Print) | 9789881821041 |
| Publication status | Published - 2010 |
| Event | International MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010) - , Hong Kong Duration: 17 Mar 2010 → 19 Mar 2010 |
Conference
| Conference | International MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010) |
|---|---|
| Country/Territory | Hong Kong |
| Period | 17/03/10 → 19/03/10 |