Institutional Repository
| linear complexity of binary sequences derived from polynomial quotients | |
| Chen Zhixiong; G&#; mez-P&#; rez Domingo | |
| 2012 | |
| Conference Name | 7th International Conference on Sequences and Their Applications, SETA 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 181-189 |
| Conference Date | June 4, 2012 - June 8, 2012 |
| Conference Place | Waterloo, ON, Canada |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642306143 |
| Department | (1) Department of Mathematics Putian University Putian Fujian 351100 China; (2) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100049 China; (3) University of Cantabria Avd. Los Castros s/n Santander Spain |
| English Abstract | We determine the linear complexity of p 2-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function . When w = (p - 1)/2 and , we show that the linear complexity is equal to one of the following values , depending whether . But it seems that the method can't be applied to the case of general w. © 2012 Springer-Verlag.; We determine the linear complexity of p 2-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function . When w = (p - 1)/2 and , we show that the linear complexity is equal to one of the following values , depending whether . But it seems that the method can't be applied to the case of general w. © 2012 Springer-Verlag. |
| Keyword | Cryptography Polynomials |
| Sponsorship | Univ. Waterloo, Dep. Electr. Comput. Eng.; The Fields Institute for Research in Mathematical Sciences; The Mprime Network Inc.; The Ontario Research Fund Research Excellence |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15766 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Chen Zhixiong,G&#,mez-P&#,et al. linear complexity of binary sequences derived from polynomial quotients[C],2012:181-189. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment