Orta Doğu Teknik Üniversitesi Uygulamalı Matematik Enstitüsü Seminerleri
Computing Multiplicative Inverses in Extended Finite Field
Anwar Hasan
Electrical and Computer Engineering, University of Waterloo, Kanada
Finite fields play an important role in areas such as cryptography, coding and testing of integrated circuits. Some public key
cryptosystems use very large finite fields. Arithmetic operations over large finite fields are not well supported by today’s general purpose processors. This talk critically looks into a number of practical algorithms for computing multiplicative inverses over extended finite fields.
