Show simple item record

dc.contributor.advisorTart, Lauri, juhendaja
dc.contributor.authorKuldmaa, Annabell
dc.contributor.otherTartu Ülikool. Matemaatika-informaatikateaduskondet
dc.contributor.otherTartu Ülikool. Matemaatika instituutet
dc.date.accessioned2015-08-11T12:30:10Z
dc.date.available2015-08-11T12:30:10Z
dc.date.issued2015-08-11
dc.identifier.urihttp://hdl.handle.net/10062/47870
dc.description.abstractThe 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.en
dc.language.isoengen
dc.publisherTartu Ülikoolet
dc.subjectfinite field multiplicationen
dc.subjectmodular reductionen
dc.subjectpolynomial basisen
dc.subjectnormal basisen
dc.subjectirreducible polynomialsen
dc.subjectbakalaureusetööet
dc.titleEfficient multiplication in binary fieldsen
dc.typeThesisen


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record