Skip to main content
Article thumbnail
Location of Repository

Fast Modular Reduction

By William Hasenplaugh, Gunnar Gaubatz and Vinodh Gopal

Abstract

It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hyper-) elliptic curve algorithms. In the recent decade, practitioners have relied mainly on two popular methods: Montgomery Multiplication and regular long-integer multiplication in combination with Barrett’s modular reduction technique. In this paper, we propose a modification to Barrett’s algorithm that leads to a significant reduction (25 % to 75%) in multiplications and additions. 1

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.5417
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ieeexplore.ieee.org/iel... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.