Please use this identifier to cite or link to this item:
A brief survey of the discrete logarithm problem
|Title:||A brief survey of the discrete logarithm problem|
|Authors:||Sia, Gretel S.|
|Publisher:||University of Hawaii at Manoa|
|Abstract:||The Discrete Logarithm Problem (DLP) has been the subject of interest among many mathematicians and cryptographers in recent times because of its computational di¢ culty. For the former, the enormity of the mathematics involved and the intellectual challenge that it entails are certainly motivating factors; for the latter, its usefulness in the ...eld of cryptography. Cryptosystems rest their security on some assumptions that certain mathematical problems are dificult to solve. The ElGamal cryptosystem, for instance, is considered secure because of the computational assumption that it is di¢ cult to solve the Discrete Logarithm Problem. The di¢ culty of the DLP lies in the fact that it has a “one-way” property. Its computational complexity is roughly measured by the computing time of the algorithm used to solve this mathematical problem. This paper is a brief survey of some of the best known algorithms for solving the DLP, examines their computing time, and considers the DLP over two particular ...nite groups.|
|Description:||Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2011|
|Rights:||All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.|
|Appears in Collections:||M.A. Plan B Theses- Mathematics Department|
Please email firstname.lastname@example.org if you need this content in an ADA-compliant format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.