| 两类最优跳频序列集的线性复杂度 |
| |
| 引用本文： | 高军涛,胡予濮,李雪莲,向上荣.两类最优跳频序列集的线性复杂度[J].通信学报,2012(2):175-181. |
| |
| 作者姓名： | 高军涛 胡予濮 李雪莲 向上荣 |
| |
| 作者单位： | 西安电子科技大学计算机网络与信息安全教育部重点实验室;中国科学院软件研究所信息安全国家重点实验室;西安电子科技大学应用数学系;西安电子科技大学计算机学院 |
| |
| 基金项目： | 国家自然科学基金重点资助项目(60833008);国家重点基础研究发展计划(“973”计划)基金资助项目(2007CB311201);111计划(B08038);中央高校基本科研业务费专项基金资助项目(K50511010007)~~ |
| |
| 摘 要： | 利用有限域中的一类不同于幂置换的置换多项式,将两类具有低线性复杂度的跳频序列集变换为具有高线性复杂度的最优跳频序列集。通过理论证明给出了变换以后序列线性复杂度的精确值。所得到的两类新的跳频序列集不仅具有最优的Hamming相关值,而且相对于变换前的序列集具有大的线性复杂度,可以抵抗Berlekamp-Massey算法的攻击。
|
| 关 键 词： | 跳频序列 线性复杂度 置换多项式 Hamming相关 |
Linear complexity of two classes of optimal sets frequency-hopping sequences |
| |
| GAO Jun-tao,HU Yu-pu,LI Xue-lian,XIANG Shang-rong.Linear complexity of two classes of optimal sets frequency-hopping sequences[J].Journal on Communications,2012(2):175-181. |
| |
| Authors: | GAO Jun-tao HU Yu-pu LI Xue-lian XIANG Shang-rong |
| |
| Institution: | 1.Key Lab.of Computer Networks and Information Security,Ministry of Education,Xidian University,Xi’an 710071,China; 2.State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Sciences,Beijing 100190,China; 3.Department of Applied Mathematics,Xidian University,Xi’an 710071,China; 4.School of Computer and Technology,Xidian University,Xi’an 710071,China) |
| |
| Abstract: | By using a type of permutation polynomials which were different from power permutations,the two classes of frequency-hopping sequence sets with low linear complexity was transformed into the ones with high linear complexity.The exact values of linear complexity of these sequences were given by applying the theoretical proof.The results show that the two new classes of frequency-hopping sequences sets not only have optimal Hamming correlation,but also have larger linear span and can resist the Berlekamp-Massey attack compared with the two primary classes of frequency-hop-ping sequence sets. |
| |
| Keywords: | frequency-hopping sequence linear complexity permutation polynomial Hamming correlation |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
| 点击此处可从《通信学报》下载免费的PDF全文 |
|
