• DocumentCode
    1320571
  • Title

    Complexity and fast algorithms for multiexponentiations

  • Author

    Dimitrov, Vassil S. ; Jullien, Graham A. ; Miller, William C.

  • Author_Institution
    GETA, Helsinki Univ. of Technol., Hut, Finland
  • Volume
    49
  • Issue
    2
  • fYear
    2000
  • fDate
    2/1/2000 12:00:00 AM
  • Firstpage
    141
  • Lastpage
    147
  • Abstract
    In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper
  • Keywords
    computational complexity; cryptography; protocols; binary-like complex arithmetic; complexity; cryptographic protocols; multiexponentiations; multiple modular exponentiation operations; performance; Arithmetic; Costs; Cryptographic protocols; Elliptic curve cryptography; Hamming weight;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.833110
  • Filename
    833110
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1320571