dc.contributor.advisor | Gjøsteen, Kristian | nb_NO |
dc.contributor.author | Spaans, Ruben Grønning | nb_NO |
dc.date.accessioned | 2014-12-19T14:00:11Z | |
dc.date.available | 2014-12-19T14:00:11Z | |
dc.date.created | 2013-09-19 | nb_NO |
dc.date.issued | 2013 | nb_NO |
dc.identifier | 649817 | nb_NO |
dc.identifier | ntnudaim:8447 | nb_NO |
dc.identifier.uri | http://hdl.handle.net/11250/259184 | |
dc.description.abstract | The Number Field Sieve (NFS) is the fastest known general method for factoring integers having more than 120 digits. In this thesis we will will study the algebraic number theory that lies behind the algorithm, describe the algorithm in detail, implement it and use our implementation to perform some experiments. | nb_NO |
dc.language | eng | nb_NO |
dc.publisher | Institutt for matematiske fag | nb_NO |
dc.title | Number Field Sieve | nb_NO |
dc.type | Master thesis | nb_NO |
dc.source.pagenumber | 103 | nb_NO |
dc.contributor.department | Norges teknisk-naturvitenskapelige universitet, Fakultet for informasjonsteknologi, matematikk og elektroteknikk, Institutt for matematiske fag | nb_NO |