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...
محفوظ في:
| المؤلف الرئيسي: | Gutub, Adnan (author) |
|---|---|
| مؤلفون آخرون: | unknown (author) |
| التنسيق: | article |
| منشور في: |
2007
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/156/1/G.pdf https://eprints.kfupm.edu.sa/id/eprint/156/2/g.htm |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Efficient Scalable VLSI Architecture for Montgomery Inversion in GF(p)
حسب: Gutub, Adnan
منشور في: (2004) -
Efficient scalable hardware architecture for Montgomery inverse computation in GF(p)
حسب: Gutub, A.A.A.
منشور في: (2003) -
New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)
حسب: Gutub, Adnan
منشور في: (2002) -
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
حسب: Gutub, Adnan
منشور في: (2006) -
Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations
حسب: Gutub, Adnan
منشور في: (2007)