首页 | 官方网站   微博 | 高级检索  
     

具有大2-adic与k错2-adic复杂度的周期序列
引用本文:董丽华,胡予濮,曾勇.具有大2-adic与k错2-adic复杂度的周期序列[J].华南理工大学学报(自然科学版),2007,35(5):86-89.
作者姓名:董丽华  胡予濮  曾勇
作者单位:西安电子科技大学,计算机网络与信息安全国家教育部重点实验室,陕西,西安 710071
摘    要:在密码学的流密码理论当中,2-adic复杂度、k错2-adic复杂度类似于其它复杂度测度,同样要具有较大的数值.文中借助数论中的中国剩余定理等相关理论研究了二元序列的2-adic复杂度与线性复杂度的关系,证明了具有最大2-adic复杂度以及较大k错2-adic复杂度的N周期序列的存在性,给出了具有这种性质的周期序列的数目的下界.以此种周期序列作为密钥流序列可以有效地抵抗穷举攻击.

关 键 词:信息安全  密码学  2-adic复杂度  k错2-adic复杂度  周期序列
文章编号:1000-565X(2007)05-0086-04
修稿时间:2005-12-05

Periodic Sequences with Large 2-adic and k-error 2-adic Complexities
Dong Li-hua,Hu Yu-pu,Zeng Yong.Periodic Sequences with Large 2-adic and k-error 2-adic Complexities[J].Journal of South China University of Technology(Natural Science Edition),2007,35(5):86-89.
Authors:Dong Li-hua  Hu Yu-pu  Zeng Yong
Abstract:According to the theory of stream ciphers in cryptology,the 2-adic complexity and the k-error 2-adic complexity similar to other complexity measures must have large values.In this paper,the relationship between the linear complexity and the 2-adic complexity is investigated based on the Chinese Remainder Theorem and some other related theories in the number theory,and the existence of N-periodic sequences that simultaneously achieve the maximum 2-adic complexity and a great k-error 2-adic complexity is proved.Then,a lower bound of the number of the N-periodic sequences with such properties is given.The existence of many such sequences can effectively thwart the attacks against the keystreams by exhaustive search.
Keywords:information security  cryptography  2-adic complexity  k-error 2-adic complexity  periodic sequence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号