New methods for finite field arithmetic Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9306t265q

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize an extensive speedup in modular addition and subtraction routines and some small speedup in the modular multiplication routine with an arbitrary prime modulus p which is of arbitrary length. The most important feature of the method is that it avoids bit-level operations which are slow on microprocessors and performs word-level operations which are significantly faster. The proposed method has applications in public-key cryptographic algorithms defined over the finite field GF(p), most notably the elliptic curve digital signature algorithm. The new method provides up to 13% speedup in the execution of the ECDSA algorithm over the field GF(p) for the length of p in the range 161≤k≤256. In the finite extension field GF(p[superscript k]) we describe two new methods for obtaining fast software implementations of the modular multiplication operation with an arbitrary prime modulus p, which has less bit-length than the word-length of a microprocessor and an arbitrary generator polynomial. The second algorithm is a significant improvement over the first algorithm by using the same concepts introduced in GF(p) arithmetic.
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-6670 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-15T20:26:38Z (GMT) No. of bitstreams: 1 YanikTugrul2002.pdf: 568799 bytes, checksum: 58b27f42747e71c17e473de4847ee224 (MD5)
  • description.provenance : Made available in DSpace on 2012-08-15T20:26:38Z (GMT). No. of bitstreams: 1 YanikTugrul2002.pdf: 568799 bytes, checksum: 58b27f42747e71c17e473de4847ee224 (MD5) Previous issue date: 2001-11-21
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-15T20:23:15Z (GMT) No. of bitstreams: 1 YanikTugrul2002.pdf: 568799 bytes, checksum: 58b27f42747e71c17e473de4847ee224 (MD5)
  • description.provenance : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2012-08-14T23:44:55Z No. of bitstreams: 1 YanikTugrul2002.pdf: 568799 bytes, checksum: 58b27f42747e71c17e473de4847ee224 (MD5)

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items