2lt阶二元环切序列的扩展

Discret. Math. Algorithms Appl. Pub Date : 2022-09-26 DOI:10.1142/s1793830922501464

Debashis Ghosh

{"title":"2lt阶二元环切序列的扩展","authors":"Debashis Ghosh","doi":"10.1142/s1793830922501464","DOIUrl":null,"url":null,"abstract":"Several reasonably cyclotomic sequences are constructed by cyclotomic classes having good pseudo-randomness property. In this paper, we derive the linear complexity of an extended binary cyclotomic sequences of order [Formula: see text] over finite field having period [Formula: see text]. Our result shows that these sequences have higher linear complexity, which can resist linear attack.","PeriodicalId":342835,"journal":{"name":"Discret. Math. Algorithms Appl.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An extension of binary cyclotomic sequences having order 2lt\",\"authors\":\"Debashis Ghosh\",\"doi\":\"10.1142/s1793830922501464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several reasonably cyclotomic sequences are constructed by cyclotomic classes having good pseudo-randomness property. In this paper, we derive the linear complexity of an extended binary cyclotomic sequences of order [Formula: see text] over finite field having period [Formula: see text]. Our result shows that these sequences have higher linear complexity, which can resist linear attack.\",\"PeriodicalId\":342835,\"journal\":{\"name\":\"Discret. Math. Algorithms Appl.\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Math. Algorithms Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830922501464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Algorithms Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830922501464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

利用具有良好伪随机性的切环类构造了几个合理的切环序列。本文导出了一类具有周期的有限域上[公式:见文]阶的扩展二元环切序列的线性复杂度。结果表明，这些序列具有较高的线性复杂度，可以抵抗线性攻击。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

An extension of binary cyclotomic sequences having order 2lt

Several reasonably cyclotomic sequences are constructed by cyclotomic classes having good pseudo-randomness property. In this paper, we derive the linear complexity of an extended binary cyclotomic sequences of order [Formula: see text] over finite field having period [Formula: see text]. Our result shows that these sequences have higher linear complexity, which can resist linear attack.

求助全文

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

来源期刊

Discret. Math. Algorithms Appl.

自引率

0.00%

发文量

期刊最新文献

Graph antimagic labeling: A survey A short note on hyperenergetic Cayley graphs Inverse fair domination in the join and corona of graphs Semigroup structures via IVI-octahedron sets "Riesel" and another numbers