Implementation aspects of elliptic curve cryptography Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/3b591d163

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-17T17:39:55Z (GMT) No. of bitstreams: 1 SavasErkay2001.pdf: 926866 bytes, checksum: 776cb263f319e573fb7f16be210aa632 (MD5)
  • description.provenance : Made available in DSpace on 2012-08-17T17:43:24Z (GMT). No. of bitstreams: 1 SavasErkay2001.pdf: 926866 bytes, checksum: 776cb263f319e573fb7f16be210aa632 (MD5) Previous issue date: 2000-06-20
  • description.provenance : Submitted by Kaylee Patterson (kdpscanner@gmail.com) on 2012-08-16T18:22:44Z No. of bitstreams: 1 SavasErkay2001.pdf: 926866 bytes, checksum: 776cb263f319e573fb7f16be210aa632 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-17T17:43:24Z (GMT) No. of bitstreams: 1 SavasErkay2001.pdf: 926866 bytes, checksum: 776cb263f319e573fb7f16be210aa632 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items