Spectral modular arithmetic Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In many areas of engineering and applied mathematics, spectral methods provide very powerful tools for solving and analyzing problems. For instance, large to extremely large sizes of numbers can efficiently be multiplied by using discrete Fourier transform and convolution property. Such computations are needed when computing π to millions of digits of precision, factoring and also big prime search projects. When it comes to the utilization of spectral techniques for modular operations in public key cryptosystems two difficulties arise; the first one is the reduction needed after the multiplication step and the second is the cryptographic sizes which are much shorter than the optimal asymptotic crossovers of spectral methods. In this dissertation, a new modular reduction technique is proposed. Moreover, modular multiplication is given based on this reduction. These methods work fully in the frequency domain with some exceptions such as the initial, final and partial transformations steps. Fortunately, the new technique addresses the reduction problem however, because of the extra complexity coming from the overhead of the forward and backward transformation computations, the second goal is not easily achieved when single operations such as modular multiplication or reduction are considered. On the contrary, if operations that need several modular multiplications with respect to the same modulus are considered, this goal is more tractable. An obvious example of such an operation is the modular exponentiation i.e., the computation of c=m[superscript e] mod n where c, m, e, n are large integers. Therefore following the spectral modular multiplication operation a new modular exponentiation method is presented. Since forward and backward transformation calculations do not need to be performed for every multiplication carried during the exponentiation, the asymptotic crossover for modular exponentiation is decreased to cryptographic sizes. The method yields an efficient and highly parallel architecture for hardware implementations of public-key cryptosystems.
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 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 : Made available in DSpace on 2012-04-09T16:51:02Z (GMT). No. of bitstreams: 1 SaldamliGokay2006.pdf: 830799 bytes, checksum: d8926fe6a203f900ad5ca5c51393a2da (MD5) Previous issue date: 2005-05-23
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-04-09T16:51:02Z (GMT) No. of bitstreams: 1 SaldamliGokay2006.pdf: 830799 bytes, checksum: d8926fe6a203f900ad5ca5c51393a2da (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-04-09T16:43:16Z (GMT) No. of bitstreams: 1 SaldamliGokay2006.pdf: 830799 bytes, checksum: d8926fe6a203f900ad5ca5c51393a2da (MD5)
  • description.provenance : Submitted by Kaylee Patterson (patterka@onid.orst.edu) on 2012-04-05T18:47:12Z No. of bitstreams: 1 SaldamliGokay2006.pdf: 830799 bytes, checksum: d8926fe6a203f900ad5ca5c51393a2da (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items