Efficient Scalable VLSI Architecture for Montgomery Inversion in GF(p)
The multiplicative inversion operation is a fundamental computation in several cryptographic applications. In this work, we propose a scalable VLSI hardware to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algor...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2004
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/176/1/b.htm https://eprints.kfupm.edu.sa/id/eprint/176/2/B.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|