An expandable Montgomery modular multiplication processor
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. A design for expandable modular multiplication hardware is proposed. This design allows for cascading the hardware if larger moduli are required. The proposed design uses a Montgomery modular multipli...
Saved in:
| Main Author: | Gutub, A.A.A. (author) |
|---|---|
| Other Authors: | Amin, A.A.M. (author), unknown (author) |
| Format: | article |
| Published: |
1999
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14541/1/14541_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14541/2/14541_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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) -
GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
by: Gutub, A.A.-A.
Published: (2003) -
Efficient Scalable VLSI Architecture for Montgomery Inversion in GF(p)
by: Gutub, Adnan
Published: (2004) -
High radix parallel architecture for GF(p) elliptic curve processor
by: Gutub, A.A.-A.
Published: (2003)