• DocumentCode
    1373565
  • Title

    The Montgomery modular inverse-revisited

  • Author

    Savas, E. ; Koç, Ç K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
  • Volume
    49
  • Issue
    7
  • fYear
    2000
  • fDate
    7/1/2000 12:00:00 AM
  • Firstpage
    763
  • Lastpage
    766
  • Abstract
    We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the Kaliski-Montgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose microprocessors
  • Keywords
    cryptography; digital arithmetic; Montgomery inverse; Montgomery modular inverse; Montgomery multiplication; cryptography; modular arithmetic; modular inverse; Digital arithmetic; Elliptic curve cryptography; Iterative methods; Read only memory; Reduced instruction set computing; Research and development; Scientific computing; Software algorithms; Testing; Wires;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.863048
  • Filename
    863048
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1373565