| dc.date | 2016 | |
| dc.date | 2016-12-06T17:43:24Z | |
| dc.date | 2016-12-06T17:43:24Z | |
| dc.date.accessioned | 2018-03-29T02:00:12Z | |
| dc.date.available | 2018-03-29T02:00:12Z | |
| dc.identifier | | |
| dc.identifier | Journal Of Cellular Automata. Old City Publishing, v. 11, p. 195 - 211, 2016. | |
| dc.identifier | 15575969 | |
| dc.identifier | | |
| dc.identifier | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962897529&partnerID=40&md5=d7e7e35a8614c04ed1a738ebbf958927 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/319299 | |
| dc.identifier | 2-s2.0-84962897529 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1310067 | |
| dc.description | The self-shrinking generator is a non-linear cryptographic sequence generator designed to be used in stream cipher applications. In this work, its output sequence, the self-shrunken sequence, is computed as one of the output sequences of a linear model based on Cellular Automata. Such Automata are uniform, null, one-dimensional and use rules 102 or 60 for their computations. The linearity of these structures can be advantageous exploited to recover the complete selfshrunken sequence from a number of intercepted bits. Indeed, a Cellular Automata-based reconstruction procedure that is deterministic, does not need the knowledge of the LFSR characteristic polynomial and is performed exclusively by means of XOR operations has been proposed. © 2016 Old City Publishing, Inc. | |
| dc.description | 11 | |
| dc.description | | |
| dc.description | 195 | |
| dc.description | 211 | |
| dc.description | | |
| dc.description | | |
| dc.language | en | |
| dc.publisher | Old City Publishing | |
| dc.relation | Journal of Cellular Automata | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Linear Models For The Self-shrinking Generator Based On Ca | |
| dc.type | Artículos de revistas | |
