Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)

DOI10.1007/s12095-015-0138-5zbMath1344.94027MaRDI QIDQ267793

Yupeng Jiang, Qiuyan Wang, Dong-Dai Lin

Publication date: 11 April 2016

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0138-5

zbMATH Keywords

sequences; cryptography; minimal polynomial; linear complexity

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

94A60: Cryptography