Abstract
In this paper, algorithms for fast implementations of Montgomery's modular multiplication algorithm are proposed. These algorithms use nonredundant multibit recoding. Two techniques, one based on multiplication followed by estimation of scaled residue and the other involving integrated multiplication with scaled residue estimation, have been considered in detail. Techniques for simplifying the computation to estimate the multiple of the modulus to be added have been described. The area and computation time requirements of the proposed techniques are estimated for a general radix in order to highlight the time-space trade-offs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
