Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-23T13:08:28.758Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Communication, information

Published online by Cambridge University Press:  08 January 2020

YUHUI ZHOU ,
YUHUI HAN  and
YANG DING
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
*
✉dingyang@t.shu.edu.cn
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

sequencelinear complexityerror linear complexityalgebraic function fieldslocal expansion

MSC classification

Primary: 94A55: Shift register sequences and sequences over finite alphabets
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 102 , Issue 2 , October 2020 , pp. 342 - 352
Check for updates
Copyright
© 2020 Australian Mathematical Publishing Association Inc.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This work was supported by the National Natural Science Foundation of China under Grant No. 11671248.

References

Chen, Z., Edemskiy, V., Ke, P. and Wu, C., ‘On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients’, Adv. Math. Comm. 12 (2018), 805–816.CrossRefGoogle Scholar
Ding, C., Xiao, G. and Shan, W., The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science, 561 (Springer, Berlin, 1991).CrossRefGoogle Scholar
Eichler, M., Introduction to the Theory of Algebraic Numbers and Functions (Academic Press, New York, 1951).Google Scholar
Hess, F. and Shparlinski, I., ‘On the linear complexity and multidimensional distribution of congruential generators over elliptic curves’, Des. Codes Cryptogr. 35 (2005), 111–117.CrossRefGoogle Scholar
Hu, H., Gong, G. and Feng, D., ‘New results on periodic sequences with large k-error linear complexity’, in: Proc. Int. Sympos. Information Theory, Toronto, Canada, 2008 (IEEE, New York, 2008), 2409–2413.Google Scholar
Hu, H., Hu, L. and Feng, D., ‘On a class of pseudorandom sequences from elliptic curves over finite fields’, IEEE Trans. Inform. Theory 53 (2007), 2598–2605.Google Scholar
Kurosawa, K., Sato, F., Sakata, T. and Kishimoto, W., ‘A relationship between linear complexity and k-error linear complexity’, IEEE Trans. Inform. Theory 46 (2000), 694–698.CrossRefGoogle Scholar
Meidl, W. and Niederreiter, H., ‘On the expected value of the linear complexity and the k-error linear complexity of periodic sequences’, IEEE Trans. Inform. Theory 48 (2002), 2817–2825.CrossRefGoogle Scholar
Meidl, W. and Niederreiter, H., ‘Linear complexity, k-error linear complexity, and the discrete Fourier transform’, J. Complexity 18 (2002), 87–103.CrossRefGoogle Scholar
Meidl, W. and Winterhof, A., ‘On the linear complexity profile of some new explicit inversive pseudorandom numbers’, J. Complexity 20 (2004), 350–355.CrossRefGoogle Scholar
Niederreiter, H., ‘Sequences with almost perfect linear complexity profile’, in: Advances in Cryptology—EUROCRYPT’87, Lecture Notes in Computer Science, 304 (Springer, Heidelberg, 1988), 37–51.Google Scholar
Niederreiter, H., ‘Periodic sequences with large k-error linear complexity’, IEEE Trans. Inform. Theory 49 (2003), 501–505.CrossRefGoogle Scholar
Stamp, M. and Martin, C. F., ‘An algorithm for the k-error linear complexity of binary sequences with period 2n’, IEEE Trans. Inform. Theory 39 (1993), 1398–1401.CrossRefGoogle Scholar
Stichtenoth, H., Algebraic Function Fields and Codes, 2nd edn, Graduate Texts in Mathematics, 254 (Springer, Berlin, Heidelberg, 1993).Google Scholar
Tong, H., ‘Multisequences with large linear and k-error linear complexity from a tower of Artin–Schreier extensions of function fields’, Finite Fields Appl. 18 (2012), 842–854.CrossRefGoogle Scholar
Xing, C. and Ding, Y., ‘Multi-sequences with large linear complexity and k-error linear complexity from Hermitian function fields’, IEEE Trans. Inform. Theory 55 (2009), 3858–3863.CrossRefGoogle Scholar
Xing, C. and Lam, K. Y., ‘Sequences with almost perfect linear complexity profile and curves over finite fields’, IEEE Trans. Inform. Theory 45 (1999), 1267–1270.CrossRefGoogle Scholar
Xing, C., Niederreiter, H., Lam, K. Y. and Ding, C., ‘Constructions of sequences with almost perfect linear complexity profile from curves over finite fields’, Finite Fields Appl. 5 (1999), 301–313.CrossRefGoogle Scholar