The design of a test environment and its use in verification of a scalable modular multiplication and exponentiation Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Information security is an important concern in today’s communication and business world. To achieve these security functions, cryptography is utilized. RSA and the Diffie Hellman key exchange are some examples of cryptography algorithms that use modular multiplication to compute modular exponentiations. Modular multiplication requires division operations which becomes very time consuming when dealing with large numbers. Therefore, an efficient algorithm is needed, such as Montgomery multiplication, to perform modular multiplication. Montgomery multiplication is an efficient algorithm because it replaces the division operations with shifts and additions. This thesis describes a complete test environment for the Montgomery multiplication modules designed at Oregon State University, Information Security Lab. Each module was modified and corrected using the test environment to validate functionality on an FPGA. In addition to Montgomery multiplication, an exponentiation unit was redesigned to allow computation based on any radix value and any precision. The test environment can be used to test any future designs that interface to a 32-bit bus commonly used by many microprocessors.
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
Language
Replaces
Additional Information
  • description.provenance : Submitted by Philip Vue (vuep@onid.orst.edu) on 2009-01-26T17:05:31Z No. of bitstreams: 1 Elias_A_Khair.pdf: 1452885 bytes, checksum: 9d5c8ff3d069196eeac4b5d7bcbcead5 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-26T18:13:20Z (GMT) No. of bitstreams: 1 Elias_A_Khair.pdf: 1452885 bytes, checksum: 9d5c8ff3d069196eeac4b5d7bcbcead5 (MD5)
  • description.provenance : Made available in DSpace on 2009-01-26T18:13:20Z (GMT). No. of bitstreams: 1 Elias_A_Khair.pdf: 1452885 bytes, checksum: 9d5c8ff3d069196eeac4b5d7bcbcead5 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-26T18:10:34Z (GMT) No. of bitstreams: 1 Elias_A_Khair.pdf: 1452885 bytes, checksum: 9d5c8ff3d069196eeac4b5d7bcbcead5 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items