On the k-error linear complexity of binary sequences derived from polynomial quotients
On the k-error linear complexity of binary sequences derived from polynomial quotients
About this item
Full title
Author / Creator
Publisher
Beijing: Science China Press
Journal title
Language
English
Formats
Publication information
Publisher
Beijing: Science China Press
Subjects
More information
Scope and Contents
Contents
The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. In this paper, we investigate the k-error linear complexity of p2-periodic binary sequences defined from the polynomial quotients modulo p, which are the generalizations of the well-studied Fermat quotients. Indeed, first we determine ex...
Alternative Titles
Full title
On the k-error linear complexity of binary sequences derived from polynomial quotients
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1744685029
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1744685029
Other Identifiers
ISSN
1674-733X
E-ISSN
1869-1919
DOI
10.1007/s11432-014-5220-7
