| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331282 | Information Processing Letters | 2005 | 4 Pages |
Abstract
A new modification of Kaliski's algorithm for computing the Almost Montgomery Inverse, optimized for implementation in hardware, is presented. The algorithm and the corresponding portion of the hardware architecture overcome certain drawbacks of the currently used methods. In particular, the “less than/greater than” tests that represent subtractions are avoided.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Róbert Lórencz, Josef HlaváÄ,