Improving on the Number Field Sieve
| dc.contributor.advisor | Gjøsteen, Kristian | |
| dc.contributor.author | Ørke, Per Kristian | |
| dc.date.accessioned | 2015-10-06T10:57:08Z | |
| dc.date.available | 2015-10-06T10:57:08Z | |
| dc.date.created | 2015-05-31 | |
| dc.date.issued | 2015 | |
| dc.identifier | ntnudaim:11210 | |
| dc.identifier.uri | http://hdl.handle.net/11250/2352665 | |
| dc.description.abstract | We look at efficient methods for computing logarithms in finite fields of any type. To achieve this, we first develop methods for factoring integers and computing discrete logarithms in fields of prime order using algebraic number theory. Then we show how this can be improved in the general case. | |
| dc.language | eng | |
| dc.publisher | NTNU | |
| dc.subject | Matematikk, Algebra | |
| dc.title | Improving on the Number Field Sieve | |
| dc.type | Master thesis | |
| dc.source.pagenumber | 53 |
