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

V. Edemskiy, S. Koltsova
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
长度为pq的低自相关四元序列的对称四进复杂度
本文考虑长度为pq的四元序列,其中p和q是两个不同的奇素数。这些序列是基于勒让德符号构造的,具有低自相关性和高线性复杂度。我们导出了这些序列的对称4进复杂度,并证明它足以抵抗有理逼近算法的攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Code at the Receiver, Decode at the Sender: GRAND with Feedback The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder Asymmetric tree correlation testing for graph alignment Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation Deterministic K-Identification For Slow Fading Channels
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1