• DocumentCode
    776988
  • Title

    Comment on "Fast square-and-multiply exponentiation for RSA"

  • Author

    Yen, S.-M.

  • Author_Institution
    Dept. of Comput. Sci., Chung-Hua Polytech. Inst., Hsin Chu, Taiwan
  • Volume
    31
  • Issue
    9
  • fYear
    1995
  • fDate
    4/27/1995 12:00:00 AM
  • Firstpage
    712
  • Abstract
    Recently Hui and Lam announced that they had developed a new technique for improving the performance of RSA computation based on the square-and-multiply exponentiation [see ibid., vol. 30, no. 17, p. 1396-7, 1994]. In fact, their proposed algorithm is a well-known approach to exponentiation termed the m-ary method which essentially is a modification of the standard square-and-multiply algorithm
  • Keywords
    digital arithmetic; redundancy; RSA computation; m-ary method; square-and-multiply exponentiation; standard square-and-multiply algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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