Abstract
A new general algorithm is proposed for computation of the multiprecision modular reduction x mod m. This algorithm has better time estimates than the well-known Montgomery method and much better application characteristics. The algorithm does not require changes in the initial and final values of the arguments. The precomputation time is no more than the time of two multiplications.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
