• DocumentCode
    1184791
  • Title

    Montgomery reduction with even modulus

  • Author

    Koç, Ç K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
  • Volume
    141
  • Issue
    5
  • fYear
    1994
  • fDate
    9/1/1994 12:00:00 AM
  • Firstpage
    314
  • Lastpage
    316
  • Abstract
    The modular multiplication and exponentiation algorithms based on the Montgomery reduction technique require that the modulus be an odd integer. It is shown that, with the help of the Chinese remainder theorem, the Montgomery reduction algorithm can be used to efficiently perform these modular arithmetic operations with respect to an even modulus
  • Keywords
    cryptography; Chinese remainder theorem; Montgomery reduction; Montgomery reduction technique; even modulus; exponentiation algorithms; modular arithmetic operations; modular multiplication;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-2387
  • Type

    jour

  • DOI
    10.1049/ip-cdt:19941291
  • Filename
    326779
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1184791