Advanced search
Start date
Betweenand


Recovering the MSS-sequence via CA

Full text
Author(s):
Cardell, Sara D. ; Fuster-Sabater, Amparo ; Altintas, I ; Norman, M ; Dongarra, J ; Krzhizhanovskaya, VV ; Lees, M ; Sloot, PMA
Total Authors: 8
Document type: Journal article
Source: PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM; v. 80, p. 8-pg., 2016-01-01.
Abstract

A cryptographic sequence generator, the modified self-shrinking generator (MSSG), was recently designed as a novel version of the self-shrinking generator. Taking advantage of the cryptographic properties of the irregularly decimated generator class, the MSSG was mainly created to be used in stream cipher applications and hardware implementations. Nevertheless, in this work it is shown that the MSSG output sequence, the so-called modified self-shrunken sequence, is generated as one of the output sequences of a linear model based on Cellular Automata that use rule 60 for their computations. Thus, the linearity of these structures can be advantageous exploited to recover the complete modified self-shrunken sequence from a number of intercepted bits. (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