| Full text | |
| Author(s): |
Cardell, Sara D.
;
Fuster-Sabater, Amparo
Total Authors: 2
|
| Document type: | Journal article |
| Source: | FINITE FIELDS AND THEIR APPLICATIONS; v. 47, p. 222-241, SEP 2017. |
| Web of Science Citations: | 2 |
| Abstract | |
In this work, different decimation-based sequence generators for cryptographic purposes have been analyzed in detail. In fact, the modified self-shrinking generator was first introduced as an improved version of the self-shrinking generator. However, it is here proven that the sequences produced by both generators belong to the same family of sequences, that is the class of the generalized self-shrinking sequences. Thus, both sequences have the same properties as well as the same weaknesses. Moreover, such sequences can be generated by linear structures based on one-dimensional cellular automata. The linearity inherent to the cellular automata-based models can be used to launch a cryptanalytic attack against such non-linear generators. (C) 2017 Elsevier Inc. All rights reserved. (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 |