| m-序列的生成多项式计数 |
| |
| 引用本文： | 祁传达,陶有德,陈越奋.m-序列的生成多项式计数[J].数学的实践与认识,2008,38(2):59-63. |
| |
| 作者姓名： | 祁传达 陶有德 陈越奋 |
| |
| 作者单位： | 信阳师范学院,数学与信息科学学院,河南,信阳,464000 |
| |
| 摘 要： | 快速相关攻击的关键是寻找序列的项数较少、次数较低的生成多项式.提出了多项相关性的概念,利用多项相关性解决了m-序列的三项、四项和五项生成多项式计数问题,得出了生成多项式个数的表达式,为对加密系统的安全性进行评价奠定了基础.
|
| 关 键 词： | 多项相关性 快速相关攻击 m-序列 生成多项式 |
| 修稿时间： | 2006年2月28日 |
Count of Generation Polynomials for m-sequences |
| |
| QI Chuan-da,TAO You-de,CHEN Yue-fen.Count of Generation Polynomials for m-sequences[J].Mathematics in Practice and Theory,2008,38(2):59-63. |
| |
| Authors: | QI Chuan-da TAO You-de CHEN Yue-fen |
| |
| Abstract: | It is a key for the fast correlation attacks that search for generation polynomials with less terms and low degrees. This paper presented the conception of multinomial relativity,solved the problem of count for three,four and five terms generation polynomials of m-sequences used multinomial relativity,gained the expression of generation polynomial,lay a foundation for evaluating the security of encryption and communications system. |
| |
| Keywords: | multinomial relativity fast correlation attacks m-sequences generation polynomial |
| 本文献已被 万方数据 等数据库收录！ |
|
