• DocumentCode
    2312092
  • Title

    Modular multiplication in the Montgomery residue number system

  • Author

    Phillips, Braden

  • Author_Institution
    Cardiff Univ., UK
  • Volume
    2
  • fYear
    2001
  • fDate
    4-7 Nov. 2001
  • Firstpage
    1637
  • Abstract
    This paper considers the evaluation of long wordlength modular products. An algorithm is described in which long wordlength (e.g. 1024-bit) integers are represented by short-wordlength (e.g. 32-bit) Montgomery (1985) residues. Long integer modular multiplication is performed using only short-wordlength Montgomery operations. Architectures are proposed that take advantage of the parallelism afforded by this scheme.
  • Keywords
    multiplying circuits; parallel architectures; public key cryptography; residue number systems; 1024 bit; 32 bit; Montgomery residue number system; RNS; cryptography servers; long integer modular multiplication; long wordlength modular products; modular exponentiation operations; parallel architectures; public key cryptography; short-wordlength Montgomery operations; short-wordlength Montgomery residues; Dynamic range; Equations; Hardware; Pipelines; Public key cryptography;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2001. Conference Record of the Thirty-Fifth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA, USA
  • ISSN
    1058-6393
  • Print_ISBN
    0-7803-7147-X
  • Type

    conf

  • DOI
    10.1109/ACSSC.2001.987762
  • Filename
    987762
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2312092