长度为pq的低自相关四元序列的对称四进复杂度

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2023-04-23 DOI:10.1109/ITW55543.2023.10161654

V. Edemskiy, S. Koltsova

{"title":"长度为pq的低自相关四元序列的对称四进复杂度","authors":"V. Edemskiy, S. Koltsova","doi":"10.1109/ITW55543.2023.10161654","DOIUrl":null,"url":null,"abstract":"In this paper, we consider quaternary sequences of length pq, where p and q are two different odd primes. These sequences are constructed based on Legendre symbol and have low autocorrelation and high linear complexity. We derive the symmetric 4-adic complexity of these sequences and show that it is good enough to resist the attack of the rational approximation algorithm.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation\",\"authors\":\"V. Edemskiy, S. Koltsova\",\"doi\":\"10.1109/ITW55543.2023.10161654\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider quaternary sequences of length pq, where p and q are two different odd primes. These sequences are constructed based on Legendre symbol and have low autocorrelation and high linear complexity. We derive the symmetric 4-adic complexity of these sequences and show that it is good enough to resist the attack of the rational approximation algorithm.\",\"PeriodicalId\":439800,\"journal\":{\"name\":\"2023 IEEE Information Theory Workshop (ITW)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW55543.2023.10161654\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW55543.2023.10161654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文考虑长度为pq的四元序列，其中p和q是两个不同的奇素数。这些序列是基于勒让德符号构造的，具有低自相关性和高线性复杂度。我们导出了这些序列的对称4进复杂度，并证明它足以抵抗有理逼近算法的攻击。

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

查看原文本刊更多论文

Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation

In this paper, we consider quaternary sequences of length pq, where p and q are two different odd primes. These sequences are constructed based on Legendre symbol and have low autocorrelation and high linear complexity. We derive the symmetric 4-adic complexity of these sequences and show that it is good enough to resist the attack of the rational approximation algorithm.

求助全文

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

来源期刊

2023 IEEE Information Theory Workshop (ITW)

自引率

0.00%

发文量