位置：成果数据库 > 期刊 > 期刊详情页
Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General Cases
  • ISSN号：1745-1337
  • 期刊名称：Ieice Transactions ON Fundamentals of Electronics
  • 时间：2014.4
  • 页码：970-974
  • 相关项目：流密码系统中若干问题的进位模拟研究
作者： Du, Xiaoni|Zhang, Ji|Wu, Chenhuang|
同期刊论文项目
流密码系统中若干问题的进位模拟研究
期刊论文 26
同项目期刊论文
基于矩阵的无线传感器网络密钥预分配
2n周期优秀二元序列生成及其特性分析
周期为p~m的广义割圆序列线性复杂度研究
Public Key Auditing Based on Homomorphic Hash Function in Secure Cloud Storage
A generalization of the Hall's sextic residue sequences
Research on an Anonymous Authentication Scheme based on ECC for Electronic Report Systems
Attack and Analysis on The Vulnerability of Tenda Wireless Routers
Survey and Analysis on Proxy Re-Encryption Schemes
On pseudorandom sequences of symbols constructed using finite fields
Analysis of Media Cloud Architecture and Security Technology
ONE SUFFICIENT AND NECESSARY CONDITION ON BALANCED BOOLEAN FUNCTIONS WITH sigma(f)=2(2n)+2(n+3) (n &
利用层次分析法和模糊逻辑的信任多径OLSR路由协议
On the k-error linear complexity of binary sequences derived from polynomial quotients
基于RSA的可截取签名改进方案
2~n周期优秀二元序列生成及其特性分析
Some Properties of Correlation Function on Generalized Boolean Functions
周期为pq的平衡四元广义分圆序列的线性复杂度
On the Linear Complexity of New Generalized Cyclotomic Binary Sequences of Order Two and Period pqr