{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:09:09Z","timestamp":1730236149116,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/iccomm.2014.6866716","type":"proceedings-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T17:12:11Z","timestamp":1406740331000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["Efficient and cryptographically secure pseudorandom number generators based on chains of hybrid cellular automata maps"],"prefix":"10.1109","author":[{"given":"Radu","family":"Dogaru","sequence":"first","affiliation":[]},{"given":"Ioana","family":"Dogaru","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","article-title":"FPGA implementation and evaluation of two cryprographycally secure hybrid cellular automata","author":"dogaru","year":"2014","journal-title":"Proceedings of COMM2014 - Intl Conference on Communications"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2009.2031514"},{"key":"14","first-page":"295","article-title":"Generating chaotic secure sequences using tent map and a running-key approach","volume":"14","author":"vlad","year":"2013","journal-title":"Proceedings of the Romanian Academy"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCS.2009.5206126"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISEEE.2010.5628500"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCOMM.2010.5509076"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10622-4_6"},{"journal-title":"A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications","year":"2010","author":"rukhin","key":"1"},{"key":"10","first-page":"365","article-title":"Applications of natural computing in cryptology: NLFSR based on hybrid cellular automata with 5-cell neighborhood","volume":"14","author":"dogaru","year":"2013","journal-title":"Proceedings of the Romanian Academy"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.2991\/icsem.2013.173"},{"key":"6","first-page":"325","article-title":"Rabbit: A new high-performance stream cipher","volume":"2887","author":"boesgaard","year":"2003","journal-title":"FSE 2003"},{"key":"5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0375-9601(98)00086-3","article-title":"Cryptography with chaos","volume":"240","author":"baptista","year":"1998","journal-title":"Physics Letters A"},{"key":"4","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/978-3-642-02457-3_59","article-title":"Computational measurements of the transient time and of the sampling distance that enables statistical independence in the logistic map","author":"vlad","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2003.12.014"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00053-9"}],"event":{"name":"2014 10th International Conference on Communications (COMM)","start":{"date-parts":[[2014,5,29]]},"location":"Bucharest","end":{"date-parts":[[2014,5,31]]}},"container-title":["2014 10th International Conference on Communications (COMM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6856368\/6866648\/06866716.pdf?arnumber=6866716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T22:06:24Z","timestamp":1554415584000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6866716\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iccomm.2014.6866716","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}