Computer에 의한 GF($2^m$) 상에서 가산, 승산 및 제산의 실행

An Implementation of Addition.Multiplication and Inversion on GF($2^m$) by Computer

  • 유인권 (인하 대학교 전자 공학과) ;
  • 강성수 (인하 대학교 전자 공학과) ;
  • 김홍수 (인하 대학교 전자 공학과)
  • 발행 : 1987.07.03

초록

This paper develops algorithms of element generation, addition, multiplication and inversion based on GF($2^m$). Since these algorithms are implemented by general purpose computer, these are more efficient than the conventional algorithms(Table Lookup, Euclid's Algorithm) in each operation. It is also implied that they can be applied to not only the normally defined elements but the arbitrarily defined ones for constructing multi-valued logic function.

키워드