Computer and network security has recently become a popular subject due to
the explosive growth of the Internet and the migration of commerce practices to the
electronic medium. Thus the authenticity and privacy of the information transmitted
and the data stored on networked computers is of utmost importance.
The deployment of network security procedures requires the implementation of
cryptographic functions. More specifically, these include encryption, decryption, authentication,
digital signature algorithms and message-digest functions. Performance
has always been the most critical characteristic of a cryptographic function, which
determines its effectiveness.
In this thesis, we concentrate on developing high-speed algorithms and architectures
for number theoretic cryptosystems. Our work is mainly focused on implementing
elliptic curve cryptosystems efficiently, which requires space- and time-efficient
implementations of arithmetic operations over finite fields.
We introduce new methods for arithmetic operations over finite fields. Methodologies
such as precomputation, residue number system representation, and parallel
computation are adopted to obtain efficient algorithms that are applicable on a variety
of cryptographic systems and subsystems.
Since arithmetic operations in finite fields also have applications in coding theory
and computer algebra, the methods proposed in this thesis are applicable to these
applications as well. / Graduation date: 1999
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/33546 |
| Date | 02 November 1998 |
| Creators | Halbuto��ullar��, Alper |
| Contributors | Koc, Cetin K. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.002 seconds