Title : Computational studies on discrete logarithm problem

Type of Material: Thesis
Title: Computational studies on discrete logarithm problem
Researcher: Padmavathy, S
Guide: Chakravarthy, Bhagvati
Department: Department of Computer
Publisher: University of Hyderabad
Place: Hyderabad
Year: 2009
Language: English
Subject: Computer Science
Computer Engineering
Index Calculus Method
Public Key Cryptography
Linear Sieve Method
Accession No: Computational studies on discrete logarithm problem
Dissertation/Thesis Note: PhD
Fulltext: Shodhganga

00000000ntm a2200000ua 4500
001254930
003IN-AhILN
0052013-08-01 12:49:25
008__120816t2009||||ii#||||g|m||||||||||eng||
035__|a(IN-AhILN)th_254930
040__|aHYDR_500046|dIN-AhILN
041__|aeng
100__|aPadmavathy, S|eResearcher
110__|aDepartment of Computer|bUniversity of Hyderabad|dHyderabad
245__|aComputational studies on discrete logarithm problem
260__|aHyderabad|bUniversity of Hyderabad|c2009
502__|bPhD
518__|oDate of Notification|d2009
520__|aThe broad objective of the present work is computational analysis on the mathematically hard Discrete Logarithm Problem(DLP). The DLP forms the basis for several popular public key cryptosystems. For a given prime number p, a generator g and#8712; Zand#
653__|aComputer Science
653__|aComputer Engineering
653__|aIndex Calculus Method
653__|aPublic Key Cryptography
653__|aLinear Sieve Method
700__|aChakravarthy, Bhagvati|eGuide
852__|pComputational studies on discrete logarithm problem
856__|uhttp://shodhganga.inflibnet.ac.in/handle/10603/4252|yShodhganga
905__|anotification

User Feedback Comes Under This section.