Graduate Thesis Or Dissertation
 

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

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/c821gn57r

Descriptions

Attribute NameValues
Creator
Abstract
  • 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.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Language
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details Elias_A_Khair.pdf 2017-08-14 Public Download