A brief survey of the discrete logarithm problem

Date
2011
Authors
Sia, Gretel S.
Contributor
Advisor
Manes, Michelle
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
University of Hawaii at Manoa
Volume
Number/Issue
Starting Page
Ending Page
Alternative Title
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
Keywords
Citation
Extent
33 pages
Format
Geographic Location
Time Period
Related To
Table of Contents
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.
Rights Holder
Local Contexts
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.