@techreport{TR-IC-00-09,
  number = {IC-00-09},
  author = {Julio López and Ricardo Dahab},
  title = {High-Speed Software Multiplication in {$F_{2^m}$}},
  month = {May},
  year = {2000}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 10 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      In this paper we describe an efficient algorithm for multiplication in
      $F_{2^m}$, where  the   field    elements  of  $F_{2^m}$    are
      represented  in standard polynomial  basis. The proposed algorithm can
      be used   in  practical software  implementations  of  elliptic  curve
      cryptography. Our timing results, on  several platforms, show that the
      new method is significantly faster than the ``shift-and-add'' method.
  }
}