Article contents
ON THE $k$-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
Published online by Cambridge University Press: 08 January 2020
Abstract
The linear complexity and the error linear complexity are two important security measures for stream ciphers. We construct periodic sequences from function fields and show that the error linear complexity of these periodic sequences is large. We also give a lower bound for the error linear complexity of a class of nonperiodic sequences.
MSC classification
- Type
- Research Article
- Information
- Bulletin of the Australian Mathematical Society , Volume 102 , Issue 2 , October 2020 , pp. 342 - 352
- Copyright
- © 2020 Australian Mathematical Publishing Association Inc.
Footnotes
This work was supported by the National Natural Science Foundation of China under Grant No. 11671248.
References
- 2
- Cited by