<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475827104</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123831.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.1007/s001450010002</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s001450010002</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Don Coppersmith, Igor Shparlinski]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Abstract. : We obtain several lower bounds, exponential in terms of lg p , on the degrees of polynomials and algebraic functions coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points; the number of points can be as little as p 1/2 + ɛ . We also obtain improved lower bounds on the degree and sensitivity of Boolean functions on bits of x deciding whether x is a quadratic residue. Similar bounds are also proved for the Diffie—Hellman mapping g x → g x2 , where g is a primitive root of a finite field of q elements F q . These results can be used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm and breaking the Diffie—Hellman cryptosystem. The method is based on bounds of character sums and numbers of solutions of some polynomial equations.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">International Association for Criptologic Rese, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Key words. Discrete logarithms, Diffie—Hellman cryptosystem, Polynomial approximations, Boolean functions, Character sums</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Coppersmith</subfield>
   <subfield code="D">Don</subfield>
   <subfield code="u">IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, U.S.A. copper@watson.ibm.com, US</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Shparlinski</subfield>
   <subfield code="D">Igor</subfield>
   <subfield code="u">Department of Computing, Macquarie University, Sydney, NSW 2109, Australia igor@comp.mq.edu.au, AU</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Cryptology</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">13/3(2000-06-01), 339-360</subfield>
   <subfield code="x">0933-2790</subfield>
   <subfield code="q">13:3&lt;339</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">145</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s001450010002</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.1007/s001450010002</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">Coppersmith</subfield>
   <subfield code="D">Don</subfield>
   <subfield code="u">IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, U.S.A. copper@watson.ibm.com, US</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">Shparlinski</subfield>
   <subfield code="D">Igor</subfield>
   <subfield code="u">Department of Computing, Macquarie University, Sydney, NSW 2109, Australia igor@comp.mq.edu.au, AU</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">Journal of Cryptology</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">13/3(2000-06-01), 339-360</subfield>
   <subfield code="x">0933-2790</subfield>
   <subfield code="q">13:3&lt;339</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">145</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>
