{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:00:35Z","timestamp":1648713635821},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0020-0190(99)00126-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"3-7","source":"Crossref","is-referenced-by-count":1,"title":["Linear complexity of the orbits"],"prefix":"10.1016","volume":"72","author":[{"given":"F.","family":"Montoya Vitini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mu\u00f1oz Masqu\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Peinado Dom\u00ednguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00126-X_ID005","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","article-title":"A simple unpredictable pseudorandom number generator","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(99)00126-X_ID006","series-title":"Advances in Cryptology\u2014CRYPTO'84","first-page":"289","article-title":"An efficient probabilistic public key encryption scheme which hides all partial information","volume":"196","author":"Blum","year":"1985"},{"key":"10.1016\/S0020-0190(99)00126-X_ID007","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudorandom bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(99)00126-X_ID008","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1049\/el:19970440","article-title":"Blum\u2013Blum\u2013Shub generator","volume":"33","author":"Ding","year":"1997","journal-title":"Electron. Lett."},{"key":"10.1016\/S0020-0190(99)00126-X_ID009","first-page":"29","article-title":"Binary cyclotomic generators","volume":"1008","author":"Ding","year":"1995"},{"key":"10.1016\/S0020-0190(99)00126-X_ID010","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00126-X_ID011","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1049\/el:19971243","article-title":"Improvement to Nyang\u2013Song fast digital signature scheme","volume":"33","author":"He","year":"1997","journal-title":"Electron. Lett."},{"key":"10.1016\/S0020-0190(99)00126-X_ID012","series-title":"Proc. CISC'98, Seoul (Korea), December 1998","first-page":"70","article-title":"Maximal period of orbits of the BBS generator","author":"Encinas","year":"1998"},{"key":"10.1016\/S0020-0190(99)00126-X_ID013","series-title":"Finite Fields","author":"Lidl","year":"1983"},{"key":"10.1016\/S0020-0190(99)00126-X_ID014","doi-asserted-by":"crossref","unstructured":"J.L. Massey, Cryptography: Fundamentals and applications, Advanced Technology Seminars, Zurich, 1994","DOI":"10.1002\/ett.4460050405"},{"key":"10.1016\/S0020-0190(99)00126-X_ID015","series-title":"Advances in Cryptology\u2014CRYPTO'88","first-page":"173","article-title":"Efficient perfect random number generators","volume":"403","author":"Micali","year":"1990"},{"issue":"5","key":"10.1016\/S0020-0190(99)00126-X_ID016","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1049\/el:19980349","article-title":"Bound for linear complexity of BBS sequences","volume":"34","author":"Vitini","year":"1998","journal-title":"Electron. Lett."},{"key":"10.1016\/S0020-0190(99)00126-X_ID017","article-title":"Random number generation and quasi-Monte Carlo methods","volume":"63","author":"Niederreiter","year":"1992"},{"key":"10.1016\/S0020-0190(99)00126-X_ID018","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1049\/el:19970124","article-title":"Fast digital signature scheme based on the quadratic residue problem","volume":"33","author":"Nyang","year":"1997","journal-title":"Electron. Lett."},{"key":"10.1016\/S0020-0190(99)00126-X_ID019","series-title":"Digitalized signatures and public key functions as intractable as factorization","author":"Rabin","year":"1979"},{"key":"10.1016\/S0020-0190(99)00126-X_ID020","series-title":"Analysis and Design of Stream Ciphers","author":"Rueppel","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909900126X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909900126X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:50:27Z","timestamp":1556059827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909900126X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S002001909900126X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00126-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}