Sökning: "Nils-Hassan Quttineh"

Hittade 1 uppsats innehållade orden Nils-Hassan Quttineh.

  1. 1. Computational Complexity of Finite Field Multiplication

    Uppsats för yrkesexamina på grundnivå, Institutionen för systemteknik

    Författare :Nils-Hassan Quttineh; [2003]
    Nyckelord :Datorteknik; Finite Field; Multiplication; Complexity; Polynomial Bases; Normal Bases; Triangular Bases; Multiples.; Datorteknik;

    Sammanfattning : The subject for this thesis is to find a basis which minimizes the number of bit operations involved in a finite field multiplication. The number of bases of a finite field increases quickly with the extension degree, and it is therefore important to find efficient search algorithms. Only fields of characteristic two are considered. LÄS MER