Hardware design of scalable and unified modular division and Montgomery multiplication Public Deposited

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

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
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
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-27T15:19:46Z (GMT) No. of bitstreams: 1 Song_J_Park.pdf: 476512 bytes, checksum: c10c684a536b5fdbfee3bc648f2e4f06 (MD5)
  • description.provenance : Made available in DSpace on 2009-01-27T15:19:46Z (GMT). No. of bitstreams: 1 Song_J_Park.pdf: 476512 bytes, checksum: c10c684a536b5fdbfee3bc648f2e4f06 (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-27T15:14:17Z (GMT) No. of bitstreams: 1 Song_J_Park.pdf: 476512 bytes, checksum: c10c684a536b5fdbfee3bc648f2e4f06 (MD5)
  • description.provenance : Submitted by Philip Vue (vuep@onid.orst.edu) on 2009-01-26T18:04:20Z No. of bitstreams: 1 Song_J_Park.pdf: 476512 bytes, checksum: c10c684a536b5fdbfee3bc648f2e4f06 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items