|
|
|
Comparing Left-shift and Montgomery inverse implementations in ASIC
Jiri Bucek, Robert Lorencz
|
| |
| The contribution deals with comparing two implementations in ASIC of inverse algorithms - Left-shift and Montgomery inverse.
Our comparison takes in consideration time and area complexity of both algorithms synthesized into a 0.18u ASIC technology.
We exploit the possible advantages of Left-shift inversion, which needs fewer additions at the expense of more shifts than other inversion algorithms, including Montgomery inverse. Therefore we consider multi-cycle addition with a fixed-length adder and subsequent implementation details associated with using multi-cycle addition. |
|
