| 摘要: |
| 本文研究了一类具有优自相关性质的二元序列的2-adic复杂度.证明了该类序列的2-adic复杂度不小于其周期的一半，并由此证明了这类序列可抵抗有理逼近算法的攻击. |
| 关键词: 交织结构 勒让德序列 2-adic复杂度 |
| DOI： |
| 分类号:TN918.1 |
| 基金项目:国家自然科学基金（61772292；61772476）；福建省自然科学基金（2019J01273）及福建师范大学"网络与信息安全关键理论和技术"校创新团队（IRTL1207）. |
|
| STUDY OF 2-ADIC COMPLEXITY OF A CLASS OF BINARY SEQUENCES WITH OPTIMAL AUTOCORRELATION VALUES |
|
LU Li-yu1,2, KE Pin-hui1,2
|
|
1.Fujian Provincial Key Laboratory of Network Security and Cryptology;2.College of Mathematics and Informatics, Fujian Normal University, Fuzhou 350117, China
|
| Abstract: |
| In this paper, we study the 2-adic complexity of a class of binary sequences with optimal autocorrelation values. We prove that the 2-adic complexity of the considering sequences is not less than a half of its period. So this sequences can resist the attack of rational approximate algorithm. |
| Key words: interleaved structures Legendre sequences 2-adic complexity |
