1 Ocak 2017 Dergi makalesi Açık Erişim

Akyildiz, Ersan; Harold, Ndangang Yampa; Sinak, Ahmet

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Akyildiz, Ersan</dc:creator>
  <dc:creator>Harold, Ndangang Yampa</dc:creator>
  <dc:creator>Sinak, Ahmet</dc:creator>
  <dc:date>2017-01-01</dc:date>
  <dc:description>Representation of a field element plays a crucial role in the efficiency of field arithmetic. If an efficient representation of a field element in one basis exists, then field arithmetic in the hardware and/or software implementations becomes easy. Otherwise, a basis conversion to an efficient one is searched for easier arithmetic. However, this conversion often brings a storage problem for transition matrices associated with these bases. In this paper, we study this problem for conversion between normal and polynomial bases in the extension field F-qp over F-q where q = p(n). We construct transition matrices that are of a special form. This provides free storage basis conversion algorithms between normal and polynomial bases, which is crucial from the implementation point of view.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/48975</dc:identifier>
  <dc:identifier>oai:zenodo.org:48975</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>TURKISH JOURNAL OF MATHEMATICS 41(1) 96-109</dc:source>
  <dc:title>Free storage basis conversion over finite fields</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>