Cart (Loading....) | Create Account
Close category search window
 

Strengthening ECDSA Verification Algorithm to be More Suitable to Mobile Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Komathy, K. ; Dept. of Comput. Sci. & Eng., Anna Univ. ; Narayanasamy, P.

The primary objective of the paper is to augment the efficiency of signature process in elliptic curve digital signature algorithm (ECDSA), which turns out to be a bottleneck in mobile devices due to its heavy consumption of resources. An improved algorithm for strengthening the speed of verification process in ECDSA is proposed and evaluated. A comparative study of Comb algorithm with the proposed algorithm for simultaneous multiplication on the NIST-recommended elliptic curves over prime fields is done and a broad analysis of the outcomes is also carried out. Strengthening the pre-computation process with respect to the speed of execution during verification will be the crucial task of this implementation

Published in:

Computing in the Global Information Technology, 2006. ICCGI '06. International Multi-Conference on

Date of Conference:

1-3 Aug. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.