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!
|