• DocumentCode
    3012712
  • Title

    D&C Fast Exponentiation Algorithm

  • Author

    Verleker, Ashwin Prabhu ; Agarwal, Suneeta

  • Author_Institution
    Comput. Sci. & Eng. Dept., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
  • fYear
    2009
  • fDate
    28-29 Dec. 2009
  • Firstpage
    654
  • Lastpage
    656
  • Abstract
    In this paper, the idea of the divide and conquer approach is used to develop a new fast exponentiation algorithm. The proposed algorithm is primarily based on the idea of merge sort. The analysis affirms that this proposed algorithm gives an improved performance in terms of the computing speed and the amount of memory utilized.
  • Keywords
    cryptography; divide and conquer methods; sorting; data decryption; data encryption; divide and conquer approach; fast exponentiation algorithm; merge sort algorithm; Algorithm design and analysis; Computer science; Costs; Cryptography; Performance analysis; Portable computers; Public key; Sorting; Telecommunication computing; Telecommunication control; Divide and Conquer; Fast exponentiation; Merge Sort algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on
  • Conference_Location
    Trivandrum, Kerala
  • Print_ISBN
    978-1-4244-5321-4
  • Electronic_ISBN
    978-0-7695-3915-7
  • Type

    conf

  • DOI
    10.1109/ACT.2009.166
  • Filename
    5375905
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3012712