Computing the Linear Complexity in a Class of Cryptographic Sequences

Amparo Fúster-Sabater, Sara D. Cardell. Computing the Linear Complexity in a Class of Cryptographic Sequences. In Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Elena N. Stankova, Carmelo Maria Torre, Ana Maria A. C. Rocha, David Taniar, Bernady O. Apduhan, Eufemia Tarantino, Yeonseung Ryu, editors, Computational Science and Its Applications - ICCSA 2018 - 18th International Conference, Melbourne, VIC, Australia, July 2-5, 2018, Proceedings, Part I. Volume 10960 of Lecture Notes in Computer Science, pages 110-122, Springer, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.