• DocumentCode
    1182490
  • Title

    Fast square-and-multiply exponentiation for RSA

  • Author

    Hui, Lucas C. K. ; Lam, Kam-Yiu

  • Author_Institution
    Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore
  • Volume
    30
  • Issue
    17
  • fYear
    1994
  • fDate
    8/18/1994 12:00:00 AM
  • Firstpage
    1396
  • Lastpage
    1397
  • Abstract
    The authors describe a practical technique for improving the performance of square-and-multiply exponentiation. A family of linear time algorithms denoted by SS(l) where l determines the maximum length of precomputed exponents, is presented. Analysis on n-bit exponents shows that the average number of multiplications required tends to nl(l+1) for large n
  • Keywords
    cryptography; RSA; SS(l); linear time algorithms; n-bit exponents; square-and-multiply exponentiation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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