High-speed implementation of the RSA cryptosystem Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • A public key cryptosystem allows two or more parties to securely communicate over an insecure channel without establishing a physically secure channel for key exchange. The RSA cryptosystem is the most popular public key cryptosystem ever invented. It is based on the difficulty of factoring large composite numbers. Once the RSA system is setup, i.e., the modulus, the private and public exponents are determined, and the public components have been published, the senders as well as the receivers perform a single operation for signing, encryption, decryption, and verification. This operation is the computation of modular exponentiation. In this thesis, we focus on fast implementations of the modular exponentiation operation. Several methods for modular exponentiation are presented, including the binary method and the m-ary method. We give a general algorithm of implementing the m-ary method, and some examples of the quaternary method and the octal method. The standard multiplication and squaring algorithms are also discussed as methods to implement the modular multiplication and squaring operations. Two methods for performing the modular multiplication operation are given: the multiply and reduce method and the Montgomery method. The Montgomery product algorithm is used in the implementation of the modular exponentiation operation. The algorithms presented in this thesis are implemented in C and 16-bit in-line 80486 assembly code. We have performed extensive testing of the code, and obtained timing results which are given in the last chapter of the thesis.
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 : Submitted by Sergio Trujillo (jstscanner@gmail.com) on 2012-11-28T01:07:03Z No. of bitstreams: 1 PengYanqun1995.pdf: 2809210 bytes, checksum: 061fb2db4ef9216f6a23e2b2cbf092da (MD5)
  • description.provenance : Made available in DSpace on 2012-11-28T18:00:08Z (GMT). No. of bitstreams: 1 PengYanqun1995.pdf: 2809210 bytes, checksum: 061fb2db4ef9216f6a23e2b2cbf092da (MD5) Previous issue date: 1995-01-31
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-28T17:39:14Z (GMT) No. of bitstreams: 1 PengYanqun1995.pdf: 2809210 bytes, checksum: 061fb2db4ef9216f6a23e2b2cbf092da (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-11-28T18:00:08Z (GMT) No. of bitstreams: 1 PengYanqun1995.pdf: 2809210 bytes, checksum: 061fb2db4ef9216f6a23e2b2cbf092da (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items