The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation. (English) Zbl 1350.94026
Summary: In this paper we derive the linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation. These almost balanced and balanced sequences are constructed by cyclotomic classes of order four using a method presented by C. Ding et al. [IEEE Trans. Inf. Theory 47, No.1, 428–433 (2001; Zbl 1019.94009)]. We investigate the linear complexity of above-mentioned sequences over the finite fields of different orders.
MSC:
| 94A55 | Shift register sequences and sequences over finite alphabets in information and communication theory |
| 94A60 | Cryptography |
| 11T71 | Algebraic coding theory; cryptography (number-theoretic aspects) |
Citations:
Zbl 1019.94009References:
| [1] | Aly, H.; Winterhof, A., On the k-error linear complexity over \(F_p\) of Legendre and Sidelnikov sequences, Des. Codes Cryptogr., 40, 369-374 (2006) · Zbl 1205.94069 |
| [2] | Aly, H.; Meidl, W.; Winterhof, A., On the k-error linear complexity of cyclotomic sequences, J. Math. Cryptol., 1, 1-14 (2007) |
| [3] | Ding, C.; Helleseth, T.; Martinsen, H., New families of binary sequences with optimal three-level autocorrelation, IEEE Trans. Inf. Theory, 47, 428-433 (2001) · Zbl 1019.94009 |
| [4] | Edemskii, V. A., On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes, Discrete Appl. Math.. Discrete Appl. Math., Diskretn. Mat., 22, 4, 74-82 (2010), translation from · Zbl 1241.11140 |
| [5] | Golomb, S. W.; Gong, G., Signal Design for Good Correlation: For Wireless Communications, Cryptography and Radar Applications (2005), Cambridge University Press · Zbl 1097.94015 |
| [6] | Hall, M., Combinatorial Theory (1975), Wiley: Wiley New York |
| [7] | Ireland, K.; Rosen, M., A Classical Introduction to Modern Number Theory (1982), Springer: Springer Berlin · Zbl 0482.10001 |
| [8] | Lidl, R.; Niederreiter, H., Finite Fields (1983), Addison-Wesley · Zbl 0554.12010 |
| [9] | Massey, J. L.; Serconek, S., Linear complexity of periodic sequences: a general theory, (Advances in Cryptology. Advances in Cryptology, Crypto’96. Advances in Cryptology. Advances in Cryptology, Crypto’96, Lect. Notes Comput. Sci., vol. 1109 (1996), Springer), 358-371 · Zbl 1329.94047 |
| [10] | Wang, Q.; Lin, D.; Guang, X., On the linear complexity of Legendre sequences over \(F_q\), IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 97-A, 7, 1627-1630 (2014) |
| [11] | Zhang, J.; Zhao, C., The linear complexity of a class of binary sequences with period \(2p\), Appl. Algebra Eng. Commun. Comput. (09 May 2015) · Zbl 1397.94040 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
