Efficient Algorithm for Multi-Bit Montgomery Inverse Using Refined Multiplicative Inverse Modular <inline-formula> <tex-math notation="LaTeX">$2^K$ </tex-math></inline-formula>
This paper makes two major contributions. First, we propose an algorithm to compute a multiplicative inverse modulo <inline-formula> <tex-math notation="LaTeX">$2^{k}$ </tex-math></inline-formula> without using integer division by refining the Arazi–Qi al...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8571219/ |