Efficient multiplication in binary fields

Date

2015-08-11

Journal Title

Journal ISSN

Volume Title

Publisher

Tartu Ülikool

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.

Description

Keywords

finite field multiplication, modular reduction, polynomial basis, normal basis, irreducible polynomials, bakalaureusetöö

Citation