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 |
000 | 00000ntm a2200000ua 4500 | |
001 | 254930 | |
003 | IN-AhILN | |
005 | 2013-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.