• DocumentCode
    3473005
  • Title

    Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1

  • Author

    Manochehri, Kooroush ; Pourmozafari, Saadat ; Sadeghian, Babak

  • Author_Institution
    Dept. of Comput. Eng. & IT, Amirkabir Univ. of Technol., Tehran
  • fYear
    2006
  • fDate
    10-12 April 2006
  • Firstpage
    178
  • Lastpage
    185
  • Abstract
    Modulo 2n + 1 and 2n - 1 multiplication plays an important role in residue number systems. In this paper two efficient methods for converting the input number to these moduli are presented. One of them has less area than the other but the second one has more processing speed. The diminished-1 representation of numbers are most suitable for multiplication in 2n + 1 thus for this modulus the input number is converting to that representation
  • Keywords
    residue number systems; diminished-1 representation; modulo input number conversion; modulo multiplication; residue number system; Cathode ray tubes; Concurrent computing; Digital signal processing; Parallel architectures; Public key cryptography; CSA; Diminished-1; Modular multiplication; RNS; Wallace tree;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology: New Generations, 2006. ITNG 2006. Third International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    0-7695-2497-4
  • Type

    conf

  • DOI
    10.1109/ITNG.2006.60
  • Filename
    1611590
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3473005