Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/478
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMAHALANOBIS, AYANen_US
dc.contributor.authorK, HARIRAMen_US
dc.date.accessioned2015-05-06T10:56:25Z
dc.date.available2015-05-06T10:56:25Z
dc.date.issued2015-05en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/478-
dc.description.abstractIn this paper we look into the discrete log problem over finite fields. The relative hardness of this problem defines the integrity of many cryptographic systems. Therefore the ease of solvalbility of this problem has been important to cryptographer for a long time. We study the index calculus method. In prticular we focus on the function field sieve. This algorithm works well to find discrete log in the multiplicative group of finite fields Fqn with a medium or small sized subfield Fq. It has sub-exponential time complexity. We investigate various recent improvements done to this algorithm by Antoine Joux.en_US
dc.language.isoenen_US
dc.subject2015
dc.subjectFunction Field Sieveen_US
dc.subjectIndex Calculusen_US
dc.subjectDiscrete Log Problemen_US
dc.subjectPublic Key Cryptographyen_US
dc.subjectPinpointingen_US
dc.titleFunction Field Sieve: Recent advances in the index-calculus attack on the discrete logarithm problemen_US
dc.typeThesisen_US
dc.type.degreeBS-MSen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.contributor.registration20101047en_US
Appears in Collections:MS THESES

Files in This Item:
File Description SizeFormat 
ffs_thesis.pdf203.04 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.