期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
The 2-adic complexity of sum sequences of Legendre sequences
1
作者 JING Xiaoyan XU Zhefeng FENG Keqin 《纯粹数学与应用数学》 2025年第2期191-199,共9页
Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequenc... Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequence of any k many Legendre sequences and show that the 2-adic complexity of the sum sequences of any k many Legendre sequences reaches the maximum by proving the case of k=2 and 3,which implies that the sum sequences can resist the attack of rational approximation algorithm. 展开更多
关键词 2-adic complexity binary sequences Legendre symbol Legendre sequences
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部