Periodic sequences with maximal -adic complexity and large -error -adic complexity over

详细信息	查看全文 | 推荐本文 |

• 作者：Shixin Zhu^a ; ^b ; ^{zhushixin@hfut.edu.cn} ; Fulin Li^a ; ^{lflsxx66@163.com}
• 关键词：Cryptography ; N-adic numbers ; N-adic complexity ; k-error N-adic complexity ; Stream cipher
• 刊名：Journal of Complexity
• 出版年：2012
• 期刊代码：73_0885064x
• 类别：mt
• 出版时间：April, 2012
• 卷：28
• 期：2
• 页码：202-208
• 文件大小：227 K

摘要

Complexity measures for keystream sequences over play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on -error -adic complexity of periodic sequences over , and establishes the existence of periodic sequences over which simultaneously possess maximal -adic complexity and large -error -adic complexity. Under some conditions the overwhelming majority of all -periodic sequences over with maximal -adic complexity have a -error -adic complexity close to . The existence of many such sequences thwarts attacks against the keystreams by exhaustive search.