High-speed algorithms & architectures for number-theoretic cryptosystems Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are often desired because of their flexibility and cost effectiveness. In this study, we concentrate on developing high-speed and area-efficient modular multiplication and exponentiation algorithms for number-theoretic cryptosystems. The RSA algorithm, the Diffie-Hellman key exchange scheme and Digital Signature Standard require the computation of modular exponentiation, which is broken into a series of modular multiplications. One of the most interesting advances in modular exponentiation has been the introduction of Montgomery multiplication. We are interested in two aspects of modular multiplication algorithms: development of fast and convenient methods on a given hardware platform, and hardware requirements to achieve high-performance algorithms. Arithmetic operations in the Galois field GF(2[superscript]k) have several applications in coding theory, computer algebra, and cryptography. We are especially interested in cryptographic applications where k is large, such as elliptic curve 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, 8-bit Grayscale) 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 : Submitted by John Valentino (valentjo@onid.orst.edu) on 2012-09-24T20:31:34Z No. of bitstreams: 1 AcarTolga1998.pdf: 3503545 bytes, checksum: 385924cee51fd5fe19432dde5c544f02 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-09-25T17:57:16Z (GMT) No. of bitstreams: 1 AcarTolga1998.pdf: 3503545 bytes, checksum: 385924cee51fd5fe19432dde5c544f02 (MD5)
  • description.provenance : Made available in DSpace on 2012-09-25T17:57:16Z (GMT). No. of bitstreams: 1 AcarTolga1998.pdf: 3503545 bytes, checksum: 385924cee51fd5fe19432dde5c544f02 (MD5) Previous issue date: 1997-12-04
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-09-25T17:55:40Z (GMT) No. of bitstreams: 1 AcarTolga1998.pdf: 3503545 bytes, checksum: 385924cee51fd5fe19432dde5c544f02 (MD5)

Relationships

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

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items