High Speed Hardware Architecture to Compute GF(p) Montgomery Inversion with Scalability Features
Modular inversion is a fundamental process in several cryptographic systems. It can be computed in software or hardware, but hardware computation has been proven to be faster and more secure. This research focused on improving an old scalable inversion hardware architecture proposed in 2004 for fini...
Saved in:
| Main Author: | Gutub, Adnan (author) |
|---|---|
| Other Authors: | unknown (author) |
| Format: | article |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/156/1/G.pdf https://eprints.kfupm.edu.sa/id/eprint/156/2/g.htm |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient Scalable VLSI Architecture for Montgomery Inversion in GF(p)
by: Gutub, Adnan
Published: (2004) -
Efficient scalable hardware architecture for Montgomery inverse computation in GF(p)
by: Gutub, A.A.A.
Published: (2003) -
New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
by: Gutub, Adnan
Published: (2002) -
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
by: Gutub, Adnan
Published: (2006) -
Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations
by: Gutub, Adnan
Published: (2007)