Abstract
The popular Barrett modular reduction algorithm requires a suitably chosen base b≥3. In this paper, we show that the setting will cause the problem of data expansion and require more cost for performing the unique multiplication which dominates the cost of this algorithm. We shall prove that the base b can be replaced by the usual base 2. The improvement gives a little of cost saving. Besides, it is more portable and more suitable for small devices such as smartphones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.