As the information-processing and telecommunications revolutions now underway
will continue to change our life styles in the rest of the 21st century, our
personal and economic lives rely more and more on our ability to transact over
the electronic medium in a secure way. The privacy, authenticity, and integrity of
the information transmitted or stored on networked computers must be maintained
at every point of the transaction. Fortunately, cryptography provides algotrithms
and techniques for keeping information secret, for determining that the contents
of a transaction have not been tampered with, for determining who has really authorized
the transaction, and for binding the involved parties with the contents of
the transaction. Since we need security on every piece of digital equipment that
helps conduct transactions over the internet in the near future, space and time performances
of cryptographic algorithms will always remain to be among the most
critical aspects of implementing cryptographic functions.
A major class of cryptographic algorithms comprises public-key schemes which
enable to realize the message integrity and authenticity check, key distribution,
digital signature functions etc. An important category of public-key algorithms is
that of elliptic curve cryptosystems (ECC). One of the major advantages of elliptic
curve cryptosystems is that they utilize much shorter key lengths in comparison to
other well known algorithms such as RSA cryptosystems. However, as do the other
public-key cryptosystems ECC also requires computationally intensive operations.
Although the speed remains to be always the primary concern, other design constraints
such as memory might be of significant importance for certain constrained
platforms.
In this thesis, we are interested in developing space- and time-efficient hardware
and software implementations of the elliptic curve cryptosystems. The main focus
of this work is to improve and devise algorithms and hardware architectures for
arithmetic operations of finite fields used in elliptic curve cryptosystems. / Graduation date: 2001
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/32515 |
| Date | 20 June 2000 |
| Creators | Sava��, Erkay |
| Contributors | Koc, Cetin K. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0021 seconds