New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
The computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2n), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implement...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | masterThesis |
| Published: |
2002
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/167/1/PhD_Thesis.pdf https://eprints.kfupm.edu.sa/id/eprint/167/2/PhD_Thesis_Abstract_Adnan_Gutub.htm |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513388471648256 |
|---|---|
| author | Gutub, Adnan |
| author2 | unknown |
| author2_role | author |
| author_facet | Gutub, Adnan unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Gutub, Adnan unknown |
| dc.date.none.fl_str_mv | 2002-06-11 2020 |
| dc.format.none.fl_str_mv | application/pdf text/html |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/167/1/PhD_Thesis.pdf https://eprints.kfupm.edu.sa/id/eprint/167/2/PhD_Thesis_Abstract_Adnan_Gutub.htm (2002) New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n). PhD thesis, Oregon State University. |
| dc.language.none.fl_str_mv | en en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/167/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Math Computer Electrical |
| dc.title.none.fl_str_mv | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| dc.type.none.fl_str_mv | Thesis NonPeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | The computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2n), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implementations to compute the Montgomery modular inverse. We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. The proposed designs have the hardware scalability feature, which means that the design can fit on constrained areas and still handle operands of any size. In order to have long-precision calculations, the module works on small precision words. The word-size, on which the module operates, can be selected based on the area and performance requirements. The upper limit on the operand precision is dictated only by the available memory to store the operands and internal results. The scalable module is in principle capable of performing infinite-precision Montgomery inverse computation of an integer, modulo a prime number. We also propose a scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2n) fields. We adjust and modify a GF(2n) Montgomery inverse algorithm to benefit from multi-bit shifting hardware features making it very similar to the proposed best design of GF(p) inversion hardware. We compare all scalable designs with fully parallel ones based on the same basic inversion algorithm. All scalable designs consumed less area and in general showed better performance than the fully parallel ones, which makes the scalable design a very efficient solution for computing the long precision Montgomery inverse. |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | KFUPM_8e30f98d37589af820fd4cf4c5e834b2 |
| identifier_str_mv | (2002) New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n). PhD thesis, Oregon State University. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::167 |
| publishDate | 2002 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)Gutub, AdnanunknownMathComputerElectricalThe computation of the inverse of a number in finite fields, namely Galois Fields GF(p) or GF(2n), is one of the most complex arithmetic operations in cryptographic applications. In this work, we investigate the GF(p) inversion and present several phases in the design of efficient hardware implementations to compute the Montgomery modular inverse. We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. The proposed designs have the hardware scalability feature, which means that the design can fit on constrained areas and still handle operands of any size. In order to have long-precision calculations, the module works on small precision words. The word-size, on which the module operates, can be selected based on the area and performance requirements. The upper limit on the operand precision is dictated only by the available memory to store the operands and internal results. The scalable module is in principle capable of performing infinite-precision Montgomery inverse computation of an integer, modulo a prime number. We also propose a scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2n) fields. We adjust and modify a GF(2n) Montgomery inverse algorithm to benefit from multi-bit shifting hardware features making it very similar to the proposed best design of GF(p) inversion hardware. We compare all scalable designs with fully parallel ones based on the same basic inversion algorithm. All scalable designs consumed less area and in general showed better performance than the fully parallel ones, which makes the scalable design a very efficient solution for computing the long precision Montgomery inverse.2002-06-112020ThesisNonPeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdftext/htmlhttps://eprints.kfupm.edu.sa/id/eprint/167/1/PhD_Thesis.pdfhttps://eprints.kfupm.edu.sa/id/eprint/167/2/PhD_Thesis_Abstract_Adnan_Gutub.htm (2002) New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n). PhD thesis, Oregon State University. enenhttps://eprints.kfupm.edu.sa/id/eprint/167/info:eu-repo/semantics/openAccessoai::1672019-11-01T13:22:43Z |
| spellingShingle | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) Gutub, Adnan Math Computer Electrical |
| status_str | publishedVersion |
| title | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| title_full | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| title_fullStr | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| title_full_unstemmed | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| title_short | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| title_sort | New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) |
| topic | Math Computer Electrical |
| url | https://eprints.kfupm.edu.sa/id/eprint/167/1/PhD_Thesis.pdf https://eprints.kfupm.edu.sa/id/eprint/167/2/PhD_Thesis_Abstract_Adnan_Gutub.htm |