| Full text | |
| Author(s): Show less - |
Fuster-Sabater, Amparo
;
Cardell, Sara D.
;
Gervasi, O
;
Murgante, B
;
Misra, S
;
Stankova, E
;
Torre, CM
;
Rocha, AMAC
;
Taniar, D
;
Apduhan, BO
;
Tarantino, E
;
Ryu, Y
Total Authors: 12
|
| Document type: | Journal article |
| Source: | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2018, PT I; v. 10960, p. 13-pg., 2018-01-01. |
| Abstract | |
In this work, we present a method of computing the linear complexity of the sequences produced by the cryptographic sequence generator known as generalized self-shrinking generator. This approach is based on the comparison of different shifted versions of a single PN-sequence. Just the analysis of binary digits in these shifted sequences allows one to determine the linear complexity of those generalized sequences. The method is simple, direct and efficient. Furthermore, the concept of linear recurrence relationship and the rows of the Sierpinski's triangle are the basic tools in this computation. (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 |