{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:55:11Z","timestamp":1649080511406},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T00:00:00Z","timestamp":1444089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Austrian Science Fund FWF Project","award":["F5511-N26"],"award-info":[{"award-number":["F5511-N26"]}]},{"name":"Austrian Science Fund FWF Project","award":["F5511-N26"],"award-info":[{"award-number":["F5511-N26"]}]},{"name":"Hungarian National Foundation for Scientific Research","award":["K100291"],"award-info":[{"award-number":["K100291"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10623-015-0140-0","type":"journal-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T08:58:25Z","timestamp":1444121905000},"page":"259-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the linear complexity profile of some sequences derived from elliptic curves"],"prefix":"10.1007","volume":"81","author":[{"given":"L\u00e1szl\u00f3","family":"M\u00e9rai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,6]]},"reference":[{"key":"140_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein D.J., Lange T.: Faster addition and doubling on elliptic curves. In: Advances in Cryptology\u2014ASIACRYPT 2007. Lecture Notes in Computer Science, vol. 4833, pp. 29\u201350. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"140_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein D.J., Lange T.: A complete set of addition laws for incomplete Edwards curves. J. Number Theory 131(5), 858\u2013872 (2011)","DOI":"10.1016\/j.jnt.2010.06.015"},{"key":"140_CR3","unstructured":"Edwards H.M.: A normal form for elliptic curves. Bull. Am. Math. Soc. (N.S.) 44(3), 393\u2013422 (2007)."},{"key":"140_CR4","doi-asserted-by":"crossref","unstructured":"Friedlander J.B., Hansen J., Shparlinski I.E.: Character sums with exponential functions. Mathematika 47(1\u20132), 75\u201385 (2000)","DOI":"10.1112\/S0025579300015734"},{"key":"140_CR5","doi-asserted-by":"crossref","unstructured":"Griffin F., Shparlinski I.E.: On the linear complexity profile of the power generator. IEEE Trans. Inf. Theory 46(6), 2159\u20132162 (2000)","DOI":"10.1109\/18.868485"},{"key":"140_CR6","doi-asserted-by":"crossref","unstructured":"Hess F., Shparlinski I.E.: On the linear complexity and multidimensional distribution of congruential generators over elliptic curves. Des. Codes Cryptogr. 35(1), 111\u2013117 (2005)","DOI":"10.1007\/s10623-003-6153-0"},{"key":"140_CR7","unstructured":"Knuth D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley, Reading (1998)"},{"key":"140_CR8","doi-asserted-by":"crossref","unstructured":"Lange T., Shparlinski I.E.: Certain exponential sums and random walks on elliptic curves. Can. J. Math. 57(2), 338\u2013350 (2005)","DOI":"10.4153\/CJM-2005-015-8"},{"key":"140_CR9","unstructured":"Meidl W., Winterhof A.: Linear complexity of sequences and multisequences. In: Mullen G.L. (ed.) Handbook of Finite Fields. CRC Press, Boca Raton (2013)"},{"key":"140_CR10","unstructured":"M\u00e9rai L.: On the elliptic curve power generator. Unif. Distrib. Theory 9(2), 59\u201365 (2014)"},{"key":"140_CR11","doi-asserted-by":"crossref","unstructured":"Niederreiter H.: Random number generation and quasi-Monte Carlo methods. In: CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1992)","DOI":"10.1137\/1.9781611970081"},{"key":"140_CR12","doi-asserted-by":"crossref","unstructured":"Niederreiter H.: Linear complexity and related complexity measures for sequences. In: Progress in Cryptology\u2014INDOCRYPT 2003. Lecture Notes in Computer Science, vol. 2904, pp. 1\u201317. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-24582-7_1"},{"key":"140_CR13","doi-asserted-by":"crossref","unstructured":"Niederreiter H., Winterhof A.: Applied Number Theory. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-22321-6"},{"key":"140_CR14","doi-asserted-by":"crossref","unstructured":"Shparlinski I.: On the linear complexity of the power generator. Des. Codes Cryptogr. 23(1), 5\u201310 (2001)","DOI":"10.1023\/A:1011264815860"},{"key":"140_CR15","doi-asserted-by":"crossref","unstructured":"Topuzo\u011flu A., Winterhof A.: Pseudorandom sequences. In: Topics in Geometry, Coding Theory and Cryptography, vol. 6, pp. 135\u2013166. Springer, Dordrecht (2007)","DOI":"10.1007\/1-4020-5334-4_4"},{"key":"140_CR16","doi-asserted-by":"crossref","unstructured":"Washington L.C.: Elliptic curves, 2nd edn. Discrete Mathematics and Its Applications (Boca Raton) Number Theory and Cryptography. Chapman & Hall\/CRC, Boca Raton, FL (2008).","DOI":"10.1201\/9781420071474"},{"key":"140_CR17","doi-asserted-by":"crossref","unstructured":"Winterhof A.: Linear complexity and related complexity measures. In: Selected Topics in Information and Coding Theory, Series on Coding Theory and Cryptology, vol. 7, pp. 3\u201340. World Science Publication, Hackensack (2010)","DOI":"10.1142\/9789812837172_0001"},{"key":"140_CR18","doi-asserted-by":"crossref","unstructured":"Winterhof A.: Recent results on recursive nonlinear pseudorandom number generators (invited paper). In: Sequences and Their Applications\u2014SETA 2010. Lecture Notes in Computer Science, vol. 6338, pp. 113\u2013124. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15874-2_9"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0140-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0140-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0140-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:41Z","timestamp":1559231921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0140-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0140-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,6]]}}}