• DocumentCode
    964144
  • Title

    a full RNS implementation of RSA

  • Author

    Bajard, Jean-Claude ; Imbert, Laurent

  • Author_Institution
    Lab. d´´Informatique, LIRMM, Montpellier, France
  • Volume
    53
  • Issue
    6
  • fYear
    2004
  • fDate
    6/1/2004 12:00:00 AM
  • Firstpage
    769
  • Lastpage
    774
  • Abstract
    We present the first implementation of RSA in the residue number system (RNS) which does not require any conversion, either from radix to RNS beforehand or RNS to radix afterward. Our solution is based on an optimized RNS version of Montgomery multiplication. Thanks to the RNS, the proposed algorithms are highly parallelizable and seem then well suited to hardware implementations. We give the computational procedure both parties must follow in order to recover the correct result at the end of the transaction (encryption or signature).
  • Keywords
    computational complexity; cryptography; residue number systems; Montgomery multiplication; RSA; computational complexity; cryptography; residue number system; Complexity theory; Cryptography; Residue arithmetic; Cryptography; Montgomery multiplication; RSA; Residue Number Systems.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2004.2
  • Filename
    1288551
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=964144