Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T11:31:46.947Z Has data issue: false hasContentIssue false

ON THE $k$-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS

Published online by Cambridge University Press:  08 January 2020

YUHUI ZHOU
Affiliation:
Department of Mathematics, Shanghai University, Shanghai, China email yuhui1234@shu.edu.cn
YUHUI HAN
Affiliation:
Department of Mathematics, Shanghai University, Shanghai, China email 97Aimee@shu.edu.cn
YANG DING*
Affiliation:
Department of Mathematics, Shanghai University, Shanghai, China email dingyang@t.shu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© 2020 Australian Mathematical Publishing Association Inc.