Title: Linear Complexity of Least Significant Bit of Polynomial Quotients
Abstract: Chinese Journal of ElectronicsVolume 26, Issue 3 p. 573-578 ArticleFree Access Linear Complexity of Least Significant Bit of Polynomial Quotients Chun'e Zhao, Corresponding Author Chun'e Zhao [email protected] State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, 710071 China College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this authorWenping Ma, Wenping Ma State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, 710071 ChinaSearch for more papers by this authorTongjiang Yan, Tongjiang Yan College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this authorYuhua Sun, Yuhua Sun College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this author Chun'e Zhao, Corresponding Author Chun'e Zhao [email protected] State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, 710071 China College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this authorWenping Ma, Wenping Ma State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, 710071 ChinaSearch for more papers by this authorTongjiang Yan, Tongjiang Yan College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this authorYuhua Sun, Yuhua Sun College of Sciences, China University of Petroleum, Qingdao, 266555 ChinaSearch for more papers by this author First published: 01 May 2017 https://doi.org/10.1049/cje.2016.10.008Citations: 5AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat Abstract Binary sequences with large linear complexity have been found many applications in communication systems. We determine the linear complexity of a family of p2-periodic binary sequences derived from poly-nomial quotients modulo an odd prime p. Results show that these sequences have high linear complexity, which means they can resist the linear attack method. Citing Literature Volume26, Issue3May 2017Pages 573-578 RelatedInformation
Publication Year: 2017
Publication Date: 2017-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 7
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot