Year: 2015
Type: dissertation
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.
Source: BIBSYS Brage (BIBSYS (Norway))
Author: Per Kristian Ørke
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2489410098
