External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Amparo Fúster-Sabater

This author has not been identified. Look up 'Amparo Fúster-Sabater' in Google

Sara D. Cardell

This author has not been identified. Look up 'Sara D. Cardell' in Google
runs on