{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:02:25Z","timestamp":1775055745265,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429111","type":"print"},{"value":"9783540456247","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_23","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"219-228","source":"Crossref","is-referenced-by-count":8,"title":["Maximal Periods of x2 + c in Fq"],"prefix":"10.1007","author":[{"given":"A.","family":"Peinado","sequence":"first","affiliation":[]},{"given":"F.","family":"Montoya","sequence":"additional","affiliation":[]},{"given":"J.","family":"Mu\u00f1oz","sequence":"additional","affiliation":[]},{"given":"A.J.","family":"Yuste","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"23_CR1","unstructured":"Bach, E., Shallit, J., \u201cAlgorithmic Number Theory. Vol I. Efficient algorithms1\u201d, The MIT Press, 1996."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M., \u201cA simple unpredictable pseudorandom number generator\u201d, SIAM Journal on Computing, 15 (1986), pp. 364\u2013383.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1109\/18.868485","volume":"46","author":"F. Griffin","year":"2000","unstructured":"Griffin, F., Shparlinski, I., \u201cOn the linear complexity profile of the power generator\u201d, IEEE Trans. Inform. Theory, 46 (2000), pp. 2159\u20132162.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR4","unstructured":"Hern\u00e1ndez Encinas, L., Montoya Vitini, F., Mu\u00f1oz Masqu\u00e9, J., \u201cGeneraci\u00f3n de sucesiones pseudoaleatorias mediante funciones cuadr\u00e1ticas en \u2124pn, y en su l\u00edmite proyectivo\u201d, Actas de la III Reuni\u00f3n Espa\u00f1ola de Criptograf\u00eda, 27\u201332, (1994)."},{"key":"23_CR5","unstructured":"Hern\u00e1ndez Encinas, L., Montoya Vitini, F., Mu\u00f1oz Masqu\u00e9, J., Peinado Dom\u00ednguez, A., \u201cMaximal periods of orbits of the BBS generator\u201d, Proc. 1998 International Conference on Information Security & Cryptology (ICISC\u2019 98), Seoul, Korea, pp. 71\u201380, (1998)."},{"key":"23_CR6","unstructured":"Lang, S.,\u201cAlgebra\u201d, Addison-Wesley Publishing Company, 3rd ed., 1993."},{"key":"23_CR7","unstructured":"Lidl, R., Niederreiter, N., \u201cFinite Fields\u201d, Addison-Wesley Publishing Company, 1983."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Mceliece, R.,\u201cFinite Fields for computer scientist and engineers\u201d. Kluwer Academic Publishers, 1987.","DOI":"10.1007\/978-1-4613-1983-2"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0020-0190(99)00126-X","volume":"72","author":"F. Montoya","year":"1999","unstructured":"Montoya, F., Mu\u00f1oz, J., Peinado, A., \u201cLinear complexity of the x2 (mod p )orbits\u201d, Information Processing Letters, 72 (1999), pp. 3\u20137.","journal-title":"Information Processing Letters"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Narkiewicz, W., \u201cPolynomial mappings\u201d, Lecture Notes in Math., 1600. Springer, 1995.","DOI":"10.1007\/BFb0076894"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1049\/el:19970124","volume":"33","author":"D. Nyang","year":"1997","unstructured":"Nyang, D., Song, J., \u201cFast digital signature scheme based on the quadratic residue problem\u201d, Electronics Letters, 33 (1997), pp. 205\u2013206.","journal-title":"Electronics Letters"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M., \u201cA Monte Carlo method for factorization\u201d, BIT, 15 (1975), pp. 331\u2013334.","journal-title":"BIT"},{"key":"23_CR13","unstructured":"Rabin, M.O., \u201cDigitalized signatures and public key functions as intractable as factorization\u201d,Technical report,MIT\/LCS\/TR212, MIT Lab., Comp.Science, Cambridge, Mass, January 1979."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:53Z","timestamp":1556469053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}