• DocumentCode
    1208797
  • Title

    Iterative modular multiplication algorithm without magnitude comparison

  • Author

    Chiou, Che Wun ; Yang, T.C.

  • Author_Institution
    Chung Shan Inst. of Sci. & Technol., Lung-Tan
  • Volume
    30
  • Issue
    24
  • fYear
    1994
  • fDate
    11/24/1994 12:00:00 AM
  • Firstpage
    2017
  • Lastpage
    2018
  • Abstract
    A fast iterative modular multiplication algorithm is proposed for modular exponentiation with a large modulus, such as the RSA cryptosystem. The limit on partial products is raised to become less than 2n instead of modulus N with n-bit length. The naturally generated carry signifies when the computed partial product is greater than or equal to 2n, and a subtraction is subsequently performed. No magnitude comparisons are required
  • Keywords
    cryptography; iterative methods; number theory; RSA cryptosystem; cryptography; iterative modular multiplication algorithm; modular exponentiation; naturally generated carry; number-theoretic systems; partial products;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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