Efficient multiplication in binary fields
MetadataNäita täielikku nimetuse kirjet
The thesis discusses the basics of efficient multiplication in finite fields, especially in binary fields. There are two broad approaches: polynomial representation and normal bases, used in software and hardware implementations, respectively. Due to the advantages of normal bases of low complexity, there is also a brief introduction to constructing optimal normal bases. Furthermore, as irreducible polynomials are of fundamental importance for finite fields, the thesis concludes with some irreducibility test.
Selle nimetusega on seotud järgmised litsentsi failid: