Article
On the linear complexity of a new class of binary cyclotomic sequences having order $2lt$
Authors
, and
Abstract
Several reasonably cyclotomic sequences are constructed by cyclotomic classes with good pseudo-randomness property. During this paper, we derive the linear complexity of a new binary cyclotomic sequences of order $2lt$ over finite field having period $pq$. Our result shows that these sequences have high linear complexity, which can resist linear attack.
Keywords
Generalised cyclotomy, linear complexity, pseudo random sequence, stream cipher
Citation
Ghosh, D., Goswami, P., & Khan, T. (2020). On the linear complexity of a new class of binary cyclotomic sequences having order $2lt$. Turkish Journal of Computer and Mathematics Education, 11(3), 1861–1866.
D. Ghosh, P. Goswami and T. Khan, “On the linear complexity of a new class of binary cyclotomic sequences having order $2lt$,” Turkish Journal of Computer and Mathematics Education, vol. 11, no. 3, pp. 1861–1866, 2020.
Ghosh D, Goswami P, Khan T. On the linear complexity of a new class of binary cyclotomic sequences having order $2lt$. Turkish Journal of Computer and Mathematics Education. 2020;11(3):1861–1866.
Ghosh, D., Goswami, P. and Khan, T. (2020), ‘On the linear complexity of a new class of binary cyclotomic sequences having order $2lt$’, Turkish Journal of Computer and Mathematics Education, 11(3), pp. 1861–1866.
Ghosh, Debashis, et al. “On the Linear Complexity of a New Class of Binary Cyclotomic Sequences Having Order $2lt$.” Turkish Journal of Computer and Mathematics Education, vol. 11, no. 3, 2020, pp. 1861–1866.
Ghosh, Debashis, Pranab Goswami, and Tauseef Khan. “On the Linear Complexity of a New Class of Binary Cyclotomic Sequences Having Order $2lt$.” Turkish Journal of Computer and Mathematics Education 11, no. 3 (2020): 1861–1866.
Export citation
Published by: Engineering Journals
