咨询与建议

限定检索结果

文献类型

  • 42 篇 期刊文献
  • 19 篇 会议

馆藏范围

  • 61 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 54 篇 工学
    • 48 篇 计算机科学与技术...
    • 15 篇 电气工程
    • 4 篇 电子科学与技术(可...
    • 4 篇 信息与通信工程
    • 4 篇 网络空间安全
    • 1 篇 软件工程
  • 35 篇 理学
    • 35 篇 数学
    • 2 篇 统计学(可授理学、...
    • 1 篇 科学技术史(分学科...
  • 4 篇 军事学
    • 4 篇 军队指挥学
  • 2 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 公共管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 61 篇 k-error linear c...
  • 49 篇 linear complexit...
  • 19 篇 periodic sequenc...
  • 13 篇 stream ciphers
  • 11 篇 periodic sequenc...
  • 9 篇 stream cipher
  • 7 篇 algorithm
  • 7 篇 cryptography
  • 5 篇 binary sequences
  • 4 篇 pseudorandom seq...
  • 4 篇 fermat quotients
  • 4 篇 counting functio...
  • 4 篇 cube theory
  • 3 篇 discrete fourier...
  • 3 篇 sequence
  • 3 篇 euler quotients
  • 2 篇 cyclotomy
  • 2 篇 stamp-martin alg...
  • 2 篇 error sequence
  • 2 篇 sidel'nikov sequ...

机构

  • 5 篇 anhui univ techn...
  • 4 篇 curtin univ dept...
  • 4 篇 hangzhou dianzi ...
  • 4 篇 natl univ singap...
  • 4 篇 natl univ singap...
  • 3 篇 chinese acad sci...
  • 3 篇 zhengzhou inform...
  • 3 篇 univ kentucky de...
  • 3 篇 univ elect sci &...
  • 3 篇 anhui agr univ d...
  • 2 篇 univ chinese aca...
  • 2 篇 univ loughboroug...
  • 2 篇 austrian acad sc...
  • 2 篇 sabanci univ mdb...
  • 2 篇 putian univ prov...
  • 2 篇 school of comput...
  • 2 篇 school of mathem...
  • 2 篇 novgorod state u...
  • 2 篇 shanghai univ sc...
  • 2 篇 putian univ prov...

作者

  • 8 篇 zhou jianqin
  • 6 篇 wu chenhuang
  • 4 篇 liu wanquan
  • 4 篇 meidl w
  • 4 篇 niu zhihua
  • 4 篇 xu chunxiang
  • 4 篇 niederreiter h
  • 4 篇 chen zhixiong
  • 3 篇 kavuluru ramakan...
  • 3 篇 tan lin
  • 3 篇 salagean ana
  • 3 篇 alecu alexandra
  • 3 篇 qi wen-feng
  • 3 篇 meidl wilfried
  • 3 篇 tang miao
  • 2 篇 edemskiy vladimi...
  • 2 篇 xiao gz
  • 2 篇 liu feng
  • 2 篇 wei sm
  • 2 篇 lin dongdai

语言

  • 60 篇 英文
  • 1 篇 其他
检索条件"主题词=k-Error linear complexity"
61 条 记 录,以下是51-60 订阅
排序:
Periodic sequences with maximal linear complexity and large k-error linear complexity
收藏 引用
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2003年 第4期14卷 273-286页
作者: Meidl, W Niederreiter, H Natl Univ Singapore Temasek Labs Singapore 119260 Singapore Natl Univ Singapore Dept Math Singapore 117543 Singapore
The linear complexity and the k-error linear complexity are important concepts for the theory of stream ciphers in cryptology. keystreams that are suitable for stream ciphers must have large values of these complexity... 详细信息
来源: 评论
Periodic sequences with large k-error linear complexity
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2003年 第2期49卷 501-505页
作者: Niederreiter, H Natl Univ Singapore Inst Math Sci Singapore 117548 Singapore
We establish the existence of periodic sequences over a finite field which simultaneously achieve the maximum value (for the given period length) of the linear complexity and of the k-error linear complexity for small... 详细信息
来源: 评论
The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
收藏 引用
4th International Conference on Sequences and Their Applications (SETA 2006)
作者: Fu, Fang-Wei Niederreiter, Harald Su, Ming Natl Univ Singapore Temasek Labs Singapore 117508 Singapore Natl Univ Singapore Dept Math Singapore 117543 Singapore Nankai Univ Dept Math Tianjin 300071 Peoples R China
The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, using fast algorithms for computing the linear complexity and the k-error linear complexity of 2(n)-per... 详细信息
来源: 评论
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2002年 第11期48卷 2817-2825页
作者: Meidl, W Niederreiter, H Austrian Acad Sci Inst Discrete Math A-1010 Vienna Austria Natl Univ Singapore Dept Math Singapore 117543 Singapore
In his 1986 book, Rueppel conjectured that periodic binary sequences have expected linear complexity close to the period length N. In this paper, we determine the expected value of the linear complexity of N-periodic ... 详细信息
来源: 评论
linear complexity, k-error linear complexity, and the discrete Fourier transform
收藏 引用
JOURNAL OF complexity 2002年 第1期18卷 87-103页
作者: Meidl, W Niederreiter, H Austrian Acad Sci Inst Discrete Math A-1010 Vienna Austria Natl Univ Singapore Dept Math Singapore 117543 Singapore
complexity measures for sequences of elements of a finite field play an important role in cryptology. We focus first on the linear complexity of periodic sequences. By means of the discrete Fourier transform, we deter... 详细信息
来源: 评论
An efficient algorithm for k-error linear complexity
收藏 引用
CHINESE JOURNAL OF ELECTRONICS 2002年 第2期11卷 265-267页
作者: Wei, SM Xiao, GZ Chen, Z Xidian Univ Natl Key Lab ISN Xian 710071 Peoples R China Peking Univ Dept Comp Sci & Tech Informat Secur Res Grp Beijing 100871 Peoples R China Huaibei Coal Normal Coll Dept Math Huaibei 235000 Peoples R China
An efficient algorithm for computing the k-error linear complexity of a sequence over GF(q) with period p(n) is presented, where q is a prime and a primitive root modulo p(2). The new algorithm is a generalization of ... 详细信息
来源: 评论
Statistical Characteristics of the complexity for Prime-Periodic Sequences
Statistical Characteristics of the Complexity for Prime-Peri...
收藏 引用
The 1st Chinese Conference on Trusted Computing and Information Security
作者: NIU Zhi-hua, LI Nai-cheng, XIAO Guo-zhen National key Lab of Integrated Service Networks, Xidian University, Xi'an 710071, Shannxi, China School of Science, Xi'an Jiaotong University, Xi'an 710071, Shaanxi, China
Using the fact that the factorization of x - 1 over GF(2) is especially explicit. we completely establish the distributions and the expected values of the linear complexity and the k-error linear complexity of the N... 详细信息
来源: 评论
How many bits have to be changed to decrease the linear complexity?
收藏 引用
DESIGNS CODES AND CRYPTOGRAPHY 2004年 第2期33卷 109-122页
作者: Meidl, W Natl Univ Singapore Temasek Labs Singapore 117508 Singapore
The k-error linear complexity of periodic binary sequences is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. For the period length p(n), where... 详细信息
来源: 评论
Fast algorithms for determining the linear complexity of period sequences  3rd
收藏 引用
3rd International Conference on Cryptology in India (INDOCRYPT 02)
作者: Xiao, GZ Wei, SM Xidian Univ ISN Natl Key Lab Xian 710071 Peoples R China Peking Univ Dept Comp Sci & Tech Beijing 100871 Peoples R China
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p(n) over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p(2);and its ... 详细信息
来源: 评论
An algorithm for the k-error linear complexity of sequences over GF( pm) with period pn, p a prime
收藏 引用
INFORMATION AND COMPUTATION 1999年 第1-2期151卷 134-147页
作者: kaida, T Uehara, S Imamura, k Kyushu Inst Technol Dept Comp Sci & Elect Fukuoka 8208502 Japan Yatsushiro Natl Coll Technol Dept Ingn Elect & Informat Kumamoto 8668501 Japan
An algorithm is given for the k-error linear complexity of sequences over GF(p(m)) with period p(n), p a prime. The algorithm is derived by the generalized Games-Chan algorithm for the linear complexity of sequences o... 详细信息
来源: 评论