一类M子序列的研究

2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI:10.1109/CIS.2012.119

Yingni Duan, Haifeng Zhang, H. Lv, Junchu Fang

{"title":"一类M子序列的研究","authors":"Yingni Duan, Haifeng Zhang, H. Lv, Junchu Fang","doi":"10.1109/CIS.2012.119","DOIUrl":null,"url":null,"abstract":"For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research on the First Class M Subsequence\",\"authors\":\"Yingni Duan, Haifeng Zhang, H. Lv, Junchu Fang\",\"doi\":\"10.1109/CIS.2012.119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.\",\"PeriodicalId\":294394,\"journal\":{\"name\":\"2012 Eighth International Conference on Computational Intelligence and Security\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Eighth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2012.119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Eighth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2012.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

针对伪随机序列生成困难的问题，在研究第一类m子序列构造的基础上，基于移位寄存器理论实现了m子序列，推导了m子序列的反馈函数表达式，并应用B-M算法分析了序列的线性复杂度。分析表明，m子序列的线性复杂度大于m序列的线性复杂度，接近m序列周期的一半。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Research on the First Class M Subsequence

For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Eighth International Conference on Computational Intelligence and Security

自引率

0.00%

发文量