کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6416981 | 1338387 | 2012 | 7 صفحه PDF | دانلود رایگان |

Complexity measures for keystream sequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error N-adic complexity of periodic sequences over Z/(N), and establishes the existence of periodic sequences over Z/(N) which simultaneously possess maximal N-adic complexity and large k-error N-adic complexity. Under some conditions the overwhelming majority of all T-periodic sequences over Z/(N) with maximal N-adic complexity logN(NTâ1) have a k-error N-adic complexity close to logN(NTâ1). The existence of many such sequences thwarts attacks against the keystreams by exhaustive search.
⺠A general upper bound on k-error N-adic complexity of periodic sequences is presented. ⺠The existence of periodic sequences with maximal N-adic complexity and large k-error N-adic complexity is proved. ⺠The overwhelming majority of all periodic sequences with maximal N-adic complexity have a large k-error N-adic complexity.
Journal: Journal of Complexity - Volume 28, Issue 2, April 2012, Pages 202-208