AN ALGORITHM FOR MULTIPLICATIONS IN F2m

  • Oh, SeYoung (Department of Mathematics Chungnam National University) ;
  • Yoon, ChungSup (Department of Mathematics Chungnam National University)
  • Received : 2003.01.16
  • Published : 2003.02.26

Abstract

An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of $F_{2^m}$ is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.

Keywords