• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Number Field Sieve for Discrete Logarithms

Haarberg, Henrik Røst
Master thesis
Thumbnail
View/Open
14190_FULLTEXT.pdf (628.6Kb)
14190_COVER.pdf (1.556Mb)
URI
http://hdl.handle.net/11250/2394427
Date
2016
Metadata
Show full item record
Collections
  • Institutt for matematiske fag [1454]
Abstract
We present two general number field sieve algorithms solving the discrete logarithm problem in finite fields. The first algorithm presented deals with discrete logarithms in prime fields, while the second considers prime power fields. We prove, using the standard heuristic, that these algorithms will run in sub-exponential time.

We also give an overview of different index calculus algorithms solving the discrete logarithm problem efficiently for different possible relations between the characteristic and the extension degree.

To be able to give a good introduction to the algorithms, we present theory necessary to understand the underlying algebraic structures used in the algorithms. This theory is largely algebraic number theory.
Publisher
NTNU

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit