Periodic sequences with maximal linear complexity and large k-error linear complexity

Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00200-003-0134-4

Title:	Periodic sequences with maximal linear complexity and large k-error linear complexity
Authors:	Meidl, W. Niederreiter, H.
Keywords:	k-Error linear complexity Linear complexity Periodic sequence Stream cipher
Issue Date:	Nov-2003
Citation:	Meidl, W., Niederreiter, H. (2003-11). Periodic sequences with maximal linear complexity and large k-error linear complexity. Applicable Algebra in Engineering, Communications and Computing 14 (4) : 273-286. ScholarBank@NUS Repository. https://doi.org/10.1007/s00200-003-0134-4
Abstract:	The linear complexity and the k-error linear complexity are important concepts for the theory of stream ciphers in cryptology. Keystreams that are suitable for stream ciphers must have large values of these complexity measures. We study periodic sequences over an arbitrary finite field Fq and establish conditions under which there are many periodic sequences over Fq with period N, maximal linear complexity N, and k-error linear complexity close to N. The existence of many such sequences thwarts attacks against the keystreams by exhaustive search.
Source Title:	Applicable Algebra in Engineering, Communications and Computing
URI:	http://scholarbank.nus.edu.sg/handle/10635/103926
ISSN:	09381279
DOI:	10.1007/s00200-003-0134-4
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check