• DocumentCode
    1413004
  • Title

    Fast modular multiplications based on precomputations with less memory

  • Author

    Tsuruoka, Y. ; Koyama, K.

  • Author_Institution
    NTT Commun. Sci. Labs., Kyoto, Japan
  • Volume
    33
  • Issue
    16
  • fYear
    1997
  • fDate
    7/31/1997 12:00:00 AM
  • Firstpage
    1370
  • Lastpage
    1371
  • Abstract
    A fast modular multiplication method based on precomputation is proposed for use in public-key cryptosystems. The proposed method can compute the Montgomery reduction TR1 mod N only through additions. Furthermore, this is 6.4 times faster than the Montgomery method implemented in modular reduction with a 512 bit modulus when 2.1 MB of memory is used. This memory size is also only 1/4 of that required in the method proposed by Takenaka et al
  • Keywords
    digital arithmetic; public key cryptography; 2.1 MB; 512 bit; Montgomery reduction; memory size; modular multiplication; precomputation; public-key cryptosystem;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19970946
  • Filename
    612156
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1413004