Efficient scalable hardware architecture for Montgomery inverse computation in GF(p)
The Montgomery inversion is a fundamental computation in several cryptographic applications. We propose a scalable hardware architecture to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate th...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14666/1/14666_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14666/2/14666_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|