• DocumentCode
    2107132
  • Title

    An RNS modular multiplication algorithm

  • Author

    Schinianakis, Dimitrios ; Stouraitis, Thanos

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Patras, Rion, Greece
  • fYear
    2013
  • fDate
    8-11 Dec. 2013
  • Firstpage
    958
  • Lastpage
    961
  • Abstract
    An RNS implementation of Barrett´s modular multiplication algorithm is presented in this paper. Existing algorithms for RNS modular multiplication employ Montgomery´s technique. An algorithmic comparison with such state-of-the-art solutions shows that the proposed algorithm may reduce the total number of modular multiplications per RNS modular multiplication by 33%-50%.
  • Keywords
    residue number systems; Barrett modular multiplication algorithm; Montgomery technique; RNS modular multiplication algorithm; residue number system; Circuits and systems; Complexity theory; Computer architecture; Context; Cryptography; Elliptic curves; Europe;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electronics, Circuits, and Systems (ICECS), 2013 IEEE 20th International Conference on
  • Conference_Location
    Abu Dhabi
  • Type

    conf

  • DOI
    10.1109/ICECS.2013.6815571
  • Filename
    6815571
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2107132