Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Linear Models For The Self-shrinking Generator Based On Ca|
|Abstract:||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.|
|Editor:||Old City Publishing|
|Citation:||Journal Of Cellular Automata. Old City Publishing, v. 11, p. 195 - 211, 2016.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.