{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:15:18Z","timestamp":1648728918762},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00445-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"193-206","source":"Crossref","is-referenced-by-count":14,"title":["Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q\u22121"],"prefix":"10.1016","volume":"128","author":[{"given":"Tanja","family":"Lange","sequence":"first","affiliation":[]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00445-6_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s001450010002","article-title":"On polynomial approximation of the discrete logarithm and the Diffie\u2013Hellman mapping","volume":"13","author":"Coppersmith","year":"2000","journal-title":"J. Cryptol."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(75)90018-3","article-title":"A class of Boolean functions with linear combinational complexity","volume":"1","author":"Harper","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB3","unstructured":"S. Jukna, A. Razborov, P. Savick\u00fd, I. Wegener, On P versus NP\u2229 co-NP for decision trees and read-once branching programs, Mathematical Foundations of Computer Science (Bratislava), Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 319\u2013326."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s000370050005","article-title":"On P versus NP\u2229CO-NP for decision trees and read-once branching programs","volume":"8","author":"Jukna","year":"1999","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB5","article-title":"A Course in Number Theory and Cryptography","volume":"Vol. 114","author":"Koblitz","year":"1994"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB6","article-title":"Algebraic aspects of cryptography","volume":"Vol. 3","author":"Koblitz","year":"1998"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.4064\/aa101-3-3","article-title":"Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions","volume":"101","author":"Lange","year":"2002","journal-title":"Acta Arith."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB8","series-title":"Finite Fields","author":"Lidl","year":"1997"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/174130.174138","article-title":"Constant depth circuits, Fourier transform, and learnability","volume":"40","author":"Linial","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB10","series-title":"Theoretical Advances in Neural Computation and Learning","first-page":"391","article-title":"Learning Boolean functions via the Fourier transform","author":"Mansour","year":"1994"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB11","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.259647","article-title":"Reducing elliptic curve logarithms to logarithms in a finite field","volume":"39","author":"Menezes","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB12","unstructured":"A. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography, Series on Discrete Mathematics and its Applications, CRC Press, Boca Raton, 1997."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4064\/aa-47-3-255-261","article-title":"A polynomial representation for logarithms in GF(q)","volume":"47","author":"Mullen","year":"1986","journal-title":"Acta Arith."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB14","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/ffta.2001.0334","article-title":"Incomplete character sums and polynomial interpolation of the discrete logarithm","volume":"8","author":"Niederreiter","year":"2002","journal-title":"Finite Fields Appl."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB15","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0220005","article-title":"Improved upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"20","author":"Parberry","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB16","article-title":"Equations Over Finite Fields","volume":"Vol. 536","author":"Schmidt","year":"1976"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB17","series-title":"Number Theoretic Methods in Cryptography","author":"Shparlinski","year":"1999"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB18","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/S0166-218X(02)00445-6_BIB19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1008300619004","article-title":"Some estimates for character sums and applications","volume":"22","author":"Winterhof","year":"2001","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0166-218X(02)00445-6_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1012556500517","article-title":"Polynomial interpolation of the discrete logarithm","volume":"25","author":"Winterhof","year":"2002","journal-title":"Des. Codes Cryptogr."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004456?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004456?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:30:12Z","timestamp":1553671812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004456"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00445-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}