具有最佳自相关性的偶数周期交错四元序列的四元复杂性

Cryptography and Communications Pub Date : 2023-12-23 DOI:10.1007/s12095-023-00690-y

Xiaoyan Jing, Zhefeng Xu

{"title":"具有最佳自相关性的偶数周期交错四元序列的四元复杂性","authors":"Xiaoyan Jing, Zhefeng Xu","doi":"10.1007/s12095-023-00690-y","DOIUrl":null,"url":null,"abstract":"Su, Yang, Zhou, and Tang proposed several new classes of optimal autocorrelation interleaved quaternary sequences with period 2n from the twin-prime sequence pairs or GMW sequence pairs. In this paper, we determine the 4-adic complexity of these quaternary sequences by using the correlation function. Our results show that the 4-adic complexity of these quaternary sequences exceeds \\(\\frac{2n-16}{6}\\), so that they are safe enough to resist the attack of the rational approximation algorithm.","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"30 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The 4-adic complexity of interleaved quaternary sequences of even period with optimal autocorrelation\",\"authors\":\"Xiaoyan Jing, Zhefeng Xu\",\"doi\":\"10.1007/s12095-023-00690-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Su, Yang, Zhou, and Tang proposed several new classes of optimal autocorrelation interleaved quaternary sequences with period 2n from the twin-prime sequence pairs or GMW sequence pairs. In this paper, we determine the 4-adic complexity of these quaternary sequences by using the correlation function. Our results show that the 4-adic complexity of these quaternary sequences exceeds \\\\(\\\\frac{2n-16}{6}\\\\), so that they are safe enough to resist the attack of the rational approximation algorithm.\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"30 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-023-00690-y\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-023-00690-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

苏、杨、周和唐提出了几类新的周期为 2n 的最优自相关交错四元序列，它们来自孪生原点序列对或 GMW 序列对。本文利用相关函数确定了这些四元序列的四元复杂度。我们的结果表明，这些四元序列的四元复杂度超过了(\frac{2n-16}{6}\)，因此它们足以安全地抵御有理逼近算法的攻击。

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

查看原文本刊更多论文

The 4-adic complexity of interleaved quaternary sequences of even period with optimal autocorrelation

Su, Yang, Zhou, and Tang proposed several new classes of optimal autocorrelation interleaved quaternary sequences with period 2n from the twin-prime sequence pairs or GMW sequence pairs. In this paper, we determine the 4-adic complexity of these quaternary sequences by using the correlation function. Our results show that the 4-adic complexity of these quaternary sequences exceeds \(\frac{2n-16}{6}\), so that they are safe enough to resist the attack of the rational approximation algorithm.

求助全文

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

来源期刊

Cryptography and Communications

自引率

0.00%

发文量