<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475807405</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123750.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1008389508626</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1008389508626</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Parallel Multiplication in GF(2k) using Polynomial Residue Arithmetic</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[A. Halbutogullari, C. Koc]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We present a novel method of parallelization of the multiplication operation in GF(2k) for an arbitrary value of k and arbitrary irreducible polynomial n(x) generating the field. The parallel algorithm is based on polynomial residue arithmetic, and requires that we find L pairwise relatively prime modulim i(x) such that the degree of the product polynomialM(x)=m 1(x)m 2(x)··· mL(x) is at least 2k. The parallel algorithm receives the residue representations of the input operands (elements of the field) and produces the result in its residue form, however, it is guaranteed that the degree of this polynomial is less than k and it is properly reduced by the generating polynomial n(x), i.e., it is an element of the field. In order to perform the reductions, we also describe a new table lookup based polynomial reduction method.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Finite field multiplication</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">residue arithmetic</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">parallel algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">cryptography</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Halbutogullari</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Matematica, Università della Basilicata, via N. Sauro 85, 85100, Potenza, (Italy)</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Koc</subfield>
   <subfield code="D">C.</subfield>
   <subfield code="u">Electrical &amp; Computer Engineering, Oregon State University, 97331, Corvallis, Oregon</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Designs, Codes and Cryptography</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">20/2(2000-06-01), 155-173</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">20:2&lt;155</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">20</subfield>
   <subfield code="o">10623</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1008389508626</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1023/A:1008389508626</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Halbutogullari</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Dipartimento di Matematica, Università della Basilicata, via N. Sauro 85, 85100, Potenza, (Italy)</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Koc</subfield>
   <subfield code="D">C.</subfield>
   <subfield code="u">Electrical &amp; Computer Engineering, Oregon State University, 97331, Corvallis, Oregon</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Designs, Codes and Cryptography</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">20/2(2000-06-01), 155-173</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">20:2&lt;155</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">20</subfield>
   <subfield code="o">10623</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
