The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve
analog of the Digital Signature Algorithm (DSA) and a federal government
approved digital signature method. In this thesis work, software optimization
techniques were applied to speed up the ECDSA for a particular NTST curve over
GF(p). The Montgomery multiplication is used extensively in the ECDSA. By
taking advantage of the algorithmic properties of the Montgomery multiplication
method, special structure of the curve parameters and also applying certain
fundamental and specific software optimization techniques, we have achieved an
overall 26% speed improvement. Further enhancements were made by
implementing the Montgomery multiplication in the ARM assembly language that
resulted in 44% speed improvement. The optimizations discussed in this thesis
could easily be adapted to other curves with or without changes. / Graduation date: 2002
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/28985 |
| Date | 19 June 2001 |
| Creators | Tanik, Haluk Kent |
| Contributors | Koc, Cetin K. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0016 seconds