Efficient multiplication in binary fields
| dc.contributor.advisor | Tart, Lauri, juhendaja | |
| dc.contributor.author | Kuldmaa, Annabell | |
| dc.contributor.other | Tartu Ülikool. Matemaatika-informaatikateaduskond | et |
| dc.contributor.other | Tartu Ülikool. Matemaatika instituut | et |
| dc.date.accessioned | 2015-08-11T12:30:10Z | |
| dc.date.available | 2015-08-11T12:30:10Z | |
| dc.date.issued | 2015-08-11 | |
| dc.description.abstract | 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. | en |
| dc.identifier.uri | http://hdl.handle.net/10062/47870 | |
| dc.language.iso | eng | en |
| dc.publisher | Tartu Ülikool | et |
| dc.subject | finite field multiplication | en |
| dc.subject | modular reduction | en |
| dc.subject | polynomial basis | en |
| dc.subject | normal basis | en |
| dc.subject | irreducible polynomials | en |
| dc.subject | bakalaureusetöö | et |
| dc.title | Efficient multiplication in binary fields | en |
| dc.type | Thesis | en |