Method and apparatus of fast modular reduction

Methods and apparatus reduce the computational load for computing r=x mod n, given two numbers x and n, where x is 2t bits long and n is t bits long. Such reduced computational loading in modular reduction schemes is useful for, at least, network communication systems that include modular reduction...

Full description

Saved in:
Bibliographic Details
Main Author She, Alfred C
Format Patent
LanguageEnglish
Published 31.03.2009
Online AccessGet full text

Cover

More Information
Summary:Methods and apparatus reduce the computational load for computing r=x mod n, given two numbers x and n, where x is 2t bits long and n is t bits long. Such reduced computational loading in modular reduction schemes is useful for, at least, network communication systems that include modular reduction in cryptography, particularly, public key encryption algorithms such as RSA, El Gamal, Rabin, and Diffie-Hellman.