Fast Galois field arithmetic for elliptic curve cryptography and error control codes Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/gh93h293v

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Today's computer and network communication systems rely on authenticated and secure transmission of information, which requires computationally efficient and low bandwidth cryptographic algorithms. Among these cryptographic algorithms are the elliptic curve cryptosystems which use the arithmetic of finite fields. Furthermore, the fields of characteristic two are preferred since they provide carry-free arithmetic and at the same time a simple way to represent field elements on current processor architectures. Arithmetic in finite field is analogous to the arithmetic of integers. When performing the multiplication operation, the finite field arithmetic uses reduction modulo the generating polynomial. The generating polynomial is an irreducible polynomial over GF(2), and the degree of this polynomial determines the size of the field, thus the bit-lengths of the operands. The fundamental arithmetic operations in finite fields are addition, multiplication, and inversion operations. The sum of two field elements is computed very easily. However, multiplication operation requires considerably more effort compared to addition. On the other hand, the inversion of a field element requires much more computational effort in terms of time and space. Therefore, we are mainly interested in obtaining implementations of field multiplication and inversion. In this dissertation, we present several new bit-parallel hardware architectures with low space and time complexity. Furthermore, an analysis and refinement of the complexity of an existing hardware algorithm and a software method highly efficient and suitable for implementation on many 32-bit processor architectures are also described.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0 on a Canon DR-9050C 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-09-17T18:37:25Z (GMT) No. of bitstreams: 1 SunarBerk1999.pdf: 2325794 bytes, checksum: cd68538ed42973e613cacbc4d2061802 (MD5)
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2012-09-14T23:38:12Z No. of bitstreams: 1 SunarBerk1999.pdf: 2325794 bytes, checksum: cd68538ed42973e613cacbc4d2061802 (MD5)
  • description.provenance : Made available in DSpace on 2012-09-26T19:55:46Z (GMT). No. of bitstreams: 1 SunarBerk1999.pdf: 2325794 bytes, checksum: cd68538ed42973e613cacbc4d2061802 (MD5) Previous issue date: 1998-11-06
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-09-26T19:55:46Z (GMT) No. of bitstreams: 1 SunarBerk1999.pdf: 2325794 bytes, checksum: cd68538ed42973e613cacbc4d2061802 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items