Linear Complexity of Binary Sequences Derived from Generalized Polynomial Quotients modulo a Prime-power

WAN Y Q, DU X N

PDF(498 KB)
Author Login
Peer Review
Editorial Board
Editor-in-Chief
PDF(498 KB)
Journal of Cryptologic Research ›› 2017, Vol. 4 ›› Issue (1) : 79-84. DOI: 10.13868/j.cnki.jcr.000164
Articles

Linear Complexity of Binary Sequences Derived from Generalized Polynomial Quotients modulo a Prime-power

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. {{journal.qiKanMingCheng_EN}}. 2017, 4(1): 79-84 https://doi.org/10.13868/j.cnki.jcr.000164

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(498 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉