Graduate Thesis Or Dissertation
 

Hardware design of scalable and unified modular division and Montgomery multiplication

Pubblico Deposited

Contenuto scaricabile

Scarica il pdf
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/tx31qn19d

Descriptions

Attribute NameValues
Creator
Abstract
  • Modular arithmetic is a basic operation for many cryptography applications such as public key cryptography, key exchange algorithms, digital signatures, and elliptic curve cryptography. Therefore, fast and efficient hardware design of modular division and multiplication is proposed for implementation of cryptography system with intent to achieve information security. The hardware unit is capable of computing modular division and Montgomery multiplication in both prime GF(p) and binary extension GF(2n) fields. Carry-save representation is adopted to create a precision independent hardware and to reduce critical path delay. However, carry-save vectors introduce issues of unsafe arithmetic right shift and ambiguous zero detection, which are investigated and resolved. Additionally, in order to alleviate the increase in area resulting from using carry-save representation, a scalable architecture is developed for the hardware design.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Dichiarazione dei diritti
Publisher
Language
Replaces

Le relazioni

Parents:

This work has no parents.

In Collection:

Elementi

Thumbnail Titolo Data caricata Visibilità Azioni
file details Song_J_Park.pdf 2017-08-19 Pubblico Scaricare