A method for analyzingthe linear complexity of generalized cyclotomic sequences with period 2mpn is proposed.It allows to pick out sequences with the high linear complexity. The linear complexity ofsome sequences is computed on the base of classes of quadratic and biquadratic residues.
Download file
Counter downloads: 81
- Title Linear complexity of generalized cyclotomicsequences with period 2mpn
- Headline Linear complexity of generalized cyclotomicsequences with period 2mpn
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 3(17)
- Date:
- DOI
Keywords
linear complexity, generalized cyclotomic sequences, линейная сложность, обобщённые циклотомические последовательностиAuthors
References
Zhang Y., LeiJ.G.,and Zhang S. P. A new family of almost differences sets and some necessary conditions / / IEEE Trans. Info. Theory. 2006. V. 52. P. 2052-2061.
Едемский В. А, Гантмахер В. Е. Синтез двоичных и троичных последовательностей с заданными ограничениями на их характеристики. Великий Новгород: НовГУ, 2009. 189 с.
Едемский В. А. О линейной сложности двоичных последовательностей на основе классов биквадратичных и шестеричных вычетов / / Дискретная математика. 2010. Т. 22. №1. С. 74-82.
Айерлэнд К., Роузен М. Классическое введение в современную теорию чисел. М.: Мир, 1987. 416 с.
Edemskiy V. А. About computation of the linear complexity of generalized cyclotomic sequences with period pn+1 / / Designs, Codes and Cryptography. 2011. V. 61. No.3. P. 251-260.
Zhang J., Zhao C.-A., and Ma X. Linear complexity of generalized cyclotomic binary sequences of length 2pm //Appl. Algebra Eng. Commun. Comput. 2010. V. 21. No. 2. P. 93-108.
Zhang J., Zhao C.-A., and Ma X. On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2 / / IEICE Trans. Fundament. Electron., Commun. Comput. Sci. 2010. V.E93.A. Iss. 1. P. 302-308.
Ding C., Helleseth T., and Martinsen H. New families of binary sequences with optimal threelevel autocorrelation / / IEEE Trans. Info Theory. 2001. V. 47. P. 428-433.
Ding C., Helleseth T., and Shan W. On the Linear Complexity of Legendre Sequences // IEEE Trans. Info Theory. 1998. V. IT-44. P. 1276-1278.
ЛидлР., Нидеррайтер Г. Конечные поля. М.: Мир, 1988. 820 с.
Cusick T. W., Ding C., and Renvall A. Stream Ciphers and Number Theory. North-Holland Mathematical Library. V. 55. Amsterdam: Elsevier, 1998.
Linear complexity of generalized cyclotomicsequences with period 2mpn | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2012. № 3(17).
Download full-text version
Download fileCounter downloads: 249