Thesis Type: Postgraduate
Institution Of The Thesis: Middle East Technical University, Turkey
Approval Date: 2017
Thesis Language: English
Student: Hasan Bartu Yünüak
Supervisor: MURAT CENKAbstract:
Modular exponentiation has an important role in many cryptographic algorithms. These exponentiation methods differ in the bases used and their representations, the repeating aspect, and for which algorithms they are used for: fixed or variable base. Our research aims to compare the efficiencies and implementation timings for some selected algorithms. Also, we look at the options for using a dedicated cubing algorithm, and compare them with the current algorithms.