Linear Models for the Self-Shrinking Generator Based on CA

Cardell, Sara D.; Fuster-Sabater, Amparo

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Linear Models for the Self-Shrinking Generator Based on CA

Full text
Author(s):	Cardell, Sara D. ; Fuster-Sabater, Amparo Total Authors: 2
Document type:	Journal article
Source:	JOURNAL OF CELLULAR AUTOMATA; v. 11, n. 2-3, p. 195-211, 2016.
Web of Science Citations:	7
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 self-shrunken 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. (AU)

FAPESP's process:	15/07246-0 - Construction, decoding and implementation of F_q linear codes. Performanca of SPC product codes and cryptanalysis of the shrinking generators.
Grantee:	Sara Díaz Cardell
Support Opportunities:	Scholarships in Brazil - Post-Doctoral

Short URL