• DocumentCode
    1281091
  • Title

    Montgomery exponentiation needs no final subtractions

  • Author

    Walter, C.D.

  • Author_Institution
    Comput. Dept., Univ. of Manchester Inst. of Sci. & Technol., UK
  • Volume
    35
  • Issue
    21
  • fYear
    1999
  • fDate
    10/14/1999 12:00:00 AM
  • Firstpage
    1831
  • Lastpage
    1832
  • Abstract
    Montgomery´s modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an exponentiation if the method is correctly set up
  • Keywords
    cryptography; digital arithmetic; Montgomery exponentiation; RSA cryptosystem; modular multiplication algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19991230
  • Filename
    810000
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1281091