Levaka, Ravi Teja Reddy (2011) Algorithm based on Booth's Encoding Pattern for Fast Scalar Point Multiplication for ECC in Wireless Sensor Networks. MTech thesis.
With the rapid increase of small devices and its usage, a better suitable security providing mechanism must be incorported keeping the resource constraints of the
devices in mind. Elliptic Curve Cryptography (ECC) serves the best and highly suitable for wireless sensor Networks (WSN) in providing security because of its smaller key size and its high strength of security against Elliptic Curve Discrete Logarithm Problem (ECDLP) than any other public-Key Cryptographic Systems. But there is a scope to reduce key calculation time to meet the potential appli-
cations, without compromising in level of security in particular for wireless sensor networks. Scalar Multiplication is the costliest operation among the operations in Elliptic Curve Cryptography which takes 80% of key calculation time on WSN motes. This research proposes an algorithm based on Booth's Encoding Pattern,
o®ering minimal Hamming Weight and signi¯cantly reduces the computational cost of scalar multiplication. Simulation results has proved that the Booth's en-coded pattern performs better over the existing techniques if there are atleast 46% number of 1's in the key on an average.
|Item Type:||Thesis (MTech)|
|Uncontrolled Keywords:||Wireless Sensor Networks, Elliptic Curve Cryptography, Point Multiplication, Non Adjacent Form, Hamming Weight|
|Subjects:||Engineering and Technology > Computer and Information Science > Networks|
Engineering and Technology > Computer and Information Science > Information Security
|Divisions:||Engineering and Technology > Department of Computer Science|
|Deposited By:||Mr. Ravi Teja Reddy Levaka|
|Deposited On:||07 Jun 2011 17:11|
|Last Modified:||07 Jun 2011 17:11|
|Supervisor(s):||Khilar, P M|
Repository Staff Only: item control page