Subtraction-free almost montgomery inverse algorithm

Authors:
Róbert Lórencz;Josef Hlaváč
Affiliations:
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, Karlovo nám. 13, 121 35 Praha 2, Czech Republic;Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, Karlovo nám. 13, 121 35 Praha 2, Czech Republic
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 0

Exponentiation using canonical recoding

Theoretical Computer Science
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Montgomery Modular Inverse-Revisited

IEEE Transactions on Computers - Special issue on computer arithmetic
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
The Montgomery Inverse and Its Applications

IEEE Transactions on Computers
Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation

ISVLSI '02 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
New hardware algorithms and designs for montgomery modular inverse computation in galois fields gf(p) and gf(2n)

New hardware algorithms and designs for montgomery modular inverse computation in galois fields gf(p) and gf(2n)

Quantified Score

Hi-index	0.89

Visualization

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.