Efficient unified Montgomery inversion with multi-bit shifting
Computation of multiplicative inverses in finite fields GF( p) and GF(2n) is the most time consuming operation in elliptic curve cryptography, especially when affine co-ordinates are used. Since the existing algorithms based on the extended Euclidean algorithm do not permit a fast software implement...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/175/1/c.htm https://eprints.kfupm.edu.sa/id/eprint/175/2/C.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|