Subtraction-free Almost Montgomery Inverse algorithm |
| |
| Authors: | Róbert Lórencz Josef Hlavá? |
| |
| Affiliation: | Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, Karlovo nám. 13, 121 35 Praha 2, Czech Republic |
| |
| 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: | Almost Montgomery Inverse algorithm Cryptography Finite field arithmetic |
| 本文献已被 ScienceDirect 等数据库收录！ |
